java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:42:59,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:42:59,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:42:59,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:42:59,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:42:59,827 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:42:59,829 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:42:59,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:42:59,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:42:59,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:42:59,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:42:59,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:42:59,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:42:59,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:42:59,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:42:59,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:42:59,839 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:42:59,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:42:59,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:42:59,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:42:59,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:42:59,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:42:59,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:42:59,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:42:59,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:42:59,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:42:59,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:42:59,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:42:59,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:42:59,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:42:59,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:42:59,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:42:59,857 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:42:59,857 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:42:59,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:42:59,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:42:59,859 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-04 11:42:59,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:42:59,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:42:59,879 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:42:59,879 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:42:59,879 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:42:59,879 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:42:59,880 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:42:59,880 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:42:59,880 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-04 11:42:59,880 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:42:59,880 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-04 11:42:59,881 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-04 11:42:59,881 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:42:59,881 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:42:59,881 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:42:59,882 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:42:59,882 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:42:59,882 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:42:59,883 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:42:59,883 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:42:59,883 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:42:59,883 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:42:59,883 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:42:59,883 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:42:59,884 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:42:59,884 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:42:59,884 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:42:59,884 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:42:59,884 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:42:59,885 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:42:59,885 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:42:59,885 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:42:59,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:59,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:42:59,886 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:42:59,886 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:42:59,886 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:42:59,886 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:42:59,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:42:59,887 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:42:59,887 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:42:59,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:42:59,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:42:59,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:42:59,936 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:42:59,936 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:42:59,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2018-12-04 11:42:59,937 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2018-12-04 11:42:59,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:42:59,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:42:59,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:59,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:42:59,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:43:00,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:43:00,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:43:00,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:43:00,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:43:00,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/1) ... [2018-12-04 11:43:00,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:43:00,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:43:00,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:43:00,061 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:43:00,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (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-04 11:43:00,138 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-04 11:43:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:43:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:43:00,378 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:43:00,379 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-04 11:43:00,379 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:43:00 BoogieIcfgContainer [2018-12-04 11:43:00,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:43:00,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:43:00,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:43:00,384 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:43:00,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:59" (1/2) ... [2018-12-04 11:43:00,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605e03be and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:43:00, skipping insertion in model container [2018-12-04 11:43:00,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:43:00" (2/2) ... [2018-12-04 11:43:00,387 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2018-12-04 11:43:00,396 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:43:00,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:43:00,420 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:43:00,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:43:00,453 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:43:00,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:43:00,453 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:43:00,453 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:43:00,453 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:43:00,454 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:43:00,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:43:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-12-04 11:43:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:43:00,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:00,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-04 11:43:00,485 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:00,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2018-12-04 11:43:00,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:00,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,728 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-04 11:43:00,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:43:00,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-04 11:43:00,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:43:00,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:43:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:43:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:43:00,763 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2018-12-04 11:43:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:00,965 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-12-04 11:43:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:43:00,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-04 11:43:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:00,979 INFO L225 Difference]: With dead ends: 26 [2018-12-04 11:43:00,979 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:43:00,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-04 11:43:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:43:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-04 11:43:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:43:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-04 11:43:01,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2018-12-04 11:43:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:01,019 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-04 11:43:01,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:43:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2018-12-04 11:43:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:43:01,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:01,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:43:01,020 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:01,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,020 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2018-12-04 11:43:01,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:01,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:01,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:01,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:43:01,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-04 11:43:01,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:43:01,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:43:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:43:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:43:01,121 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2018-12-04 11:43:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:01,239 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-12-04 11:43:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:43:01,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-04 11:43:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:01,241 INFO L225 Difference]: With dead ends: 25 [2018-12-04 11:43:01,241 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:43:01,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-04 11:43:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:43:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-12-04 11:43:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:43:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-12-04 11:43:01,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2018-12-04 11:43:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:01,249 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-04 11:43:01,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:43:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2018-12-04 11:43:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:43:01,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:01,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:43:01,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:01,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2018-12-04 11:43:01,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:01,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:01,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:43:01,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:43:01,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-04 11:43:01,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:43:01,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:43:01,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:43:01,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:43:01,321 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2018-12-04 11:43:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:01,421 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-12-04 11:43:01,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:43:01,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-04 11:43:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:01,422 INFO L225 Difference]: With dead ends: 24 [2018-12-04 11:43:01,422 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:43:01,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:43:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:43:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-04 11:43:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-04 11:43:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-04 11:43:01,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-12-04 11:43:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:01,427 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-04 11:43:01,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:43:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-04 11:43:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:43:01,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:01,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:43:01,428 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:01,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2018-12-04 11:43:01,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:01,751 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-04 11:43:01,800 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-04 11:43:01,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:01,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:01,802 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-04 11:43:01,804 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2018-12-04 11:43:01,834 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:43:01,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:43:01,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:43:01,982 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-04 11:43:01,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:43:01,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:01,991 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-04 11:43:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:02,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:02,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:02,283 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-04 11:43:02,286 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-04 11:43:02,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:02,427 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-04 11:43:02,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:02,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2018-12-04 11:43:02,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:02,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:43:02,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:43:02,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:43:02,449 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-04 11:43:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:02,719 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-12-04 11:43:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:43:02,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-04 11:43:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:02,721 INFO L225 Difference]: With dead ends: 26 [2018-12-04 11:43:02,721 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:43:02,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-04 11:43:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:43:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-04 11:43:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-04 11:43:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-04 11:43:02,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2018-12-04 11:43:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:02,727 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-04 11:43:02,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:43:02,727 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-04 11:43:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-04 11:43:02,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:02,728 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:43:02,729 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:02,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2018-12-04 11:43:02,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:02,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:02,825 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-04 11:43:02,825 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2018-12-04 11:43:02,827 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:43:02,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:43:02,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:43:02,866 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-04 11:43:02,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:02,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:43:02,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:43:02,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:02,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:02,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:02,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:03,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2018-12-04 11:43:03,048 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:03,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 11:43:03,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 11:43:03,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:43:03,050 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-12-04 11:43:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:03,445 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-04 11:43:03,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:43:03,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-12-04 11:43:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:03,446 INFO L225 Difference]: With dead ends: 31 [2018-12-04 11:43:03,446 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:43:03,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:43:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:43:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-04 11:43:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 11:43:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-04 11:43:03,451 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-12-04 11:43:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:03,452 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-04 11:43:03,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 11:43:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-04 11:43:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 11:43:03,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:03,453 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 11:43:03,453 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:03,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2018-12-04 11:43:03,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:03,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:03,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:03,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,726 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-04 11:43:03,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:03,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:03,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-04 11:43:03,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:03,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:03,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-12-04 11:43:03,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:03,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:43:03,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:43:03,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-04 11:43:03,909 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2018-12-04 11:43:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:04,235 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-04 11:43:04,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:43:04,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-04 11:43:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:04,237 INFO L225 Difference]: With dead ends: 35 [2018-12-04 11:43:04,238 INFO L226 Difference]: Without dead ends: 28 [2018-12-04 11:43:04,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-04 11:43:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-04 11:43:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-12-04 11:43:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:43:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-04 11:43:04,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-12-04 11:43:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:04,245 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-04 11:43:04,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:43:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-04 11:43:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:43:04,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:04,246 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-04 11:43:04,246 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:04,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2018-12-04 11:43:04,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:04,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:04,376 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:04,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:04,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,377 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-04 11:43:04,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:04,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:04,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:04,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:04,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:04,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:04,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:04,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-04 11:43:04,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:04,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:43:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:43:04,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-04 11:43:04,587 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2018-12-04 11:43:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:04,740 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-04 11:43:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:43:04,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-04 11:43:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:04,742 INFO L225 Difference]: With dead ends: 45 [2018-12-04 11:43:04,742 INFO L226 Difference]: Without dead ends: 26 [2018-12-04 11:43:04,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:43:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-04 11:43:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-12-04 11:43:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-04 11:43:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-04 11:43:04,750 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2018-12-04 11:43:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:04,750 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-04 11:43:04,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:43:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-04 11:43:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-04 11:43:04,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:04,751 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-04 11:43:04,752 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:04,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:04,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2018-12-04 11:43:04,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:04,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:04,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:04,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:04,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:04,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:04,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,998 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-04 11:43:05,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:05,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2018-12-04 11:43:05,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:05,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 11:43:05,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 11:43:05,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:43:05,289 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2018-12-04 11:43:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:05,723 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-04 11:43:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:43:05,728 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-12-04 11:43:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:05,729 INFO L225 Difference]: With dead ends: 49 [2018-12-04 11:43:05,729 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:43:05,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:43:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:43:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-12-04 11:43:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-04 11:43:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-04 11:43:05,736 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-12-04 11:43:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:05,736 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-04 11:43:05,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 11:43:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-04 11:43:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-04 11:43:05,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,738 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-04 11:43:05,738 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:05,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2018-12-04 11:43:05,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:05,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:05,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:05,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,913 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-04 11:43:05,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:05,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:05,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:43:05,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:05,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:06,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-12-04 11:43:06,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:06,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 11:43:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 11:43:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:43:06,099 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-12-04 11:43:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:06,670 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-12-04 11:43:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:43:06,674 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-04 11:43:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:06,675 INFO L225 Difference]: With dead ends: 60 [2018-12-04 11:43:06,675 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:43:06,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:43:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:43:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-04 11:43:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 11:43:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-04 11:43:06,684 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-12-04 11:43:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:06,684 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-04 11:43:06,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 11:43:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-04 11:43:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 11:43:06,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:06,685 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-04 11:43:06,686 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:06,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:06,686 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2018-12-04 11:43:06,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:06,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:06,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:06,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:06,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:07,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:07,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:07,290 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:07,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:07,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:07,290 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-04 11:43:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:07,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:07,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:07,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:07,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:07,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:07,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:07,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2018-12-04 11:43:07,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:07,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:43:07,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:43:07,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-04 11:43:07,502 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2018-12-04 11:43:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:07,991 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-04 11:43:07,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:43:07,991 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-04 11:43:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:07,992 INFO L225 Difference]: With dead ends: 64 [2018-12-04 11:43:07,992 INFO L226 Difference]: Without dead ends: 50 [2018-12-04 11:43:07,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-12-04 11:43:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-04 11:43:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-12-04 11:43:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 11:43:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-04 11:43:07,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2018-12-04 11:43:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:08,000 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-04 11:43:08,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:43:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-04 11:43:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 11:43:08,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:08,001 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-12-04 11:43:08,001 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:08,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:08,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2018-12-04 11:43:08,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:08,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:08,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:08,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:08,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:08,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:08,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,127 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-04 11:43:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:08,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:08,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:08,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:08,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2018-12-04 11:43:08,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:08,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:43:08,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:43:08,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-04 11:43:08,631 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2018-12-04 11:43:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:09,100 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-04 11:43:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 11:43:09,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-12-04 11:43:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:09,103 INFO L225 Difference]: With dead ends: 75 [2018-12-04 11:43:09,103 INFO L226 Difference]: Without dead ends: 40 [2018-12-04 11:43:09,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:43:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-04 11:43:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-12-04 11:43:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-04 11:43:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-04 11:43:09,111 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2018-12-04 11:43:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:09,112 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-04 11:43:09,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:43:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-04 11:43:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-04 11:43:09,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:09,113 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2018-12-04 11:43:09,114 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:09,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2018-12-04 11:43:09,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:09,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:09,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:09,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:09,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:09,388 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:09,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:09,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:09,388 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-04 11:43:09,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:09,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:09,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-04 11:43:09,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:09,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:09,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:10,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:10,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2018-12-04 11:43:10,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:10,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:43:10,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:43:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:43:10,556 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2018-12-04 11:43:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:12,936 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-12-04 11:43:12,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:43:12,937 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2018-12-04 11:43:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:12,939 INFO L225 Difference]: With dead ends: 97 [2018-12-04 11:43:12,939 INFO L226 Difference]: Without dead ends: 58 [2018-12-04 11:43:12,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:43:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-04 11:43:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-12-04 11:43:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 11:43:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-04 11:43:12,949 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2018-12-04 11:43:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:12,949 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-04 11:43:12,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:43:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-04 11:43:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 11:43:12,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:12,950 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2018-12-04 11:43:12,951 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:12,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:12,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2018-12-04 11:43:12,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:12,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:12,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:12,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:12,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:13,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:13,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:13,361 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:13,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:13,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:13,361 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-04 11:43:13,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:13,370 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:13,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:13,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:13,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:13,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:13,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:13,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2018-12-04 11:43:13,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:13,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:43:13,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:43:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-12-04 11:43:13,589 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2018-12-04 11:43:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:14,965 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2018-12-04 11:43:14,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:43:14,966 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-04 11:43:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:14,967 INFO L225 Difference]: With dead ends: 94 [2018-12-04 11:43:14,967 INFO L226 Difference]: Without dead ends: 72 [2018-12-04 11:43:14,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2018-12-04 11:43:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-04 11:43:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2018-12-04 11:43:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 11:43:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-04 11:43:14,977 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2018-12-04 11:43:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:14,978 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-04 11:43:14,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:43:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-04 11:43:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 11:43:14,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:14,979 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2018-12-04 11:43:14,980 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:14,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2018-12-04 11:43:14,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:15,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:15,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:15,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:15,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:15,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:15,131 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-04 11:43:15,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:15,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:15,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:15,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:15,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:15,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2018-12-04 11:43:15,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:15,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:43:15,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:43:15,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-04 11:43:15,497 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2018-12-04 11:43:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:15,777 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-12-04 11:43:15,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 11:43:15,777 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-12-04 11:43:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:15,778 INFO L225 Difference]: With dead ends: 105 [2018-12-04 11:43:15,779 INFO L226 Difference]: Without dead ends: 54 [2018-12-04 11:43:15,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:43:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-04 11:43:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-12-04 11:43:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-04 11:43:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-04 11:43:15,789 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2018-12-04 11:43:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:15,789 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-04 11:43:15,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:43:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-04 11:43:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-04 11:43:15,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:15,791 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2018-12-04 11:43:15,791 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:15,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2018-12-04 11:43:15,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:15,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:15,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:16,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:16,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:16,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:16,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:16,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:16,120 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-04 11:43:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:16,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:16,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 11:43:16,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:16,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:16,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:16,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:16,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2018-12-04 11:43:16,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:16,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 11:43:16,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 11:43:16,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:43:16,499 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-12-04 11:43:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:17,783 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-04 11:43:17,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:43:17,787 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-12-04 11:43:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:17,788 INFO L225 Difference]: With dead ends: 109 [2018-12-04 11:43:17,788 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 11:43:17,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:43:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 11:43:17,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2018-12-04 11:43:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-04 11:43:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-04 11:43:17,805 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2018-12-04 11:43:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:17,805 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-04 11:43:17,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 11:43:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-04 11:43:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-04 11:43:17,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:17,808 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2018-12-04 11:43:17,808 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:17,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2018-12-04 11:43:17,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:17,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:17,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:18,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:18,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:18,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:18,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:18,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:18,115 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-04 11:43:18,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:18,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:18,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:18,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:18,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:18,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:18,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:18,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2018-12-04 11:43:18,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:18,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 11:43:18,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 11:43:18,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:43:18,515 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2018-12-04 11:43:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:18,856 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-12-04 11:43:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 11:43:18,856 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-12-04 11:43:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:18,857 INFO L225 Difference]: With dead ends: 120 [2018-12-04 11:43:18,858 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:43:18,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:43:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:43:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-04 11:43:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 11:43:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-04 11:43:18,868 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2018-12-04 11:43:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:18,868 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-04 11:43:18,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 11:43:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-04 11:43:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 11:43:18,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:18,870 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2018-12-04 11:43:18,870 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:18,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2018-12-04 11:43:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:18,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:18,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:19,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:19,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,245 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-04 11:43:19,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:19,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:19,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:19,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2018-12-04 11:43:19,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:19,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:43:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:43:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2018-12-04 11:43:19,589 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2018-12-04 11:43:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:21,161 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-12-04 11:43:21,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:43:21,161 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-12-04 11:43:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:21,163 INFO L225 Difference]: With dead ends: 124 [2018-12-04 11:43:21,163 INFO L226 Difference]: Without dead ends: 94 [2018-12-04 11:43:21,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-12-04 11:43:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-04 11:43:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2018-12-04 11:43:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 11:43:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-04 11:43:21,174 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2018-12-04 11:43:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:21,174 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-04 11:43:21,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:43:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-04 11:43:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 11:43:21,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:21,176 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-12-04 11:43:21,176 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:21,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2018-12-04 11:43:21,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:21,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:21,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:21,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:21,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:21,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:21,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:21,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:21,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:21,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:21,396 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-04 11:43:21,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:21,405 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:21,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-04 11:43:21,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:21,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:21,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:21,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:21,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2018-12-04 11:43:21,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:21,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:43:21,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:43:21,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-12-04 11:43:21,800 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2018-12-04 11:43:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:22,183 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-04 11:43:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:43:22,183 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-12-04 11:43:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:22,184 INFO L225 Difference]: With dead ends: 135 [2018-12-04 11:43:22,184 INFO L226 Difference]: Without dead ends: 68 [2018-12-04 11:43:22,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-04 11:43:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-04 11:43:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-04 11:43:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-04 11:43:22,195 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2018-12-04 11:43:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:22,196 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-04 11:43:22,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:43:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-04 11:43:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-04 11:43:22,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:22,201 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2018-12-04 11:43:22,201 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:22,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2018-12-04 11:43:22,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:22,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:22,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:22,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:22,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:22,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:22,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:22,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:22,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:43:22,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:22,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:22,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:22,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:22,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:23,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:23,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:23,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2018-12-04 11:43:23,335 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:23,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 11:43:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 11:43:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:43:23,336 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2018-12-04 11:43:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:25,180 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-04 11:43:25,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:43:25,180 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2018-12-04 11:43:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:25,181 INFO L225 Difference]: With dead ends: 139 [2018-12-04 11:43:25,181 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 11:43:25,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:43:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 11:43:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2018-12-04 11:43:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-04 11:43:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-04 11:43:25,194 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2018-12-04 11:43:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:25,194 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-04 11:43:25,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 11:43:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-04 11:43:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-04 11:43:25,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:25,195 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2018-12-04 11:43:25,196 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:25,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2018-12-04 11:43:25,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:25,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:25,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:25,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:25,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:25,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:25,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:25,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:25,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:25,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:25,420 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-04 11:43:25,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:25,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:25,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:25,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:26,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:26,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2018-12-04 11:43:26,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:26,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 11:43:26,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 11:43:26,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:43:26,073 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2018-12-04 11:43:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:26,457 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-12-04 11:43:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 11:43:26,458 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-12-04 11:43:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:26,459 INFO L225 Difference]: With dead ends: 150 [2018-12-04 11:43:26,459 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 11:43:26,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:43:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 11:43:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-04 11:43:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 11:43:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-04 11:43:26,473 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2018-12-04 11:43:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:26,473 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-04 11:43:26,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 11:43:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-04 11:43:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 11:43:26,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:26,474 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2018-12-04 11:43:26,475 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:26,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2018-12-04 11:43:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:26,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:26,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:26,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:26,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:26,970 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:26,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:26,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:26,970 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-04 11:43:26,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:26,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:26,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 11:43:26,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:27,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:28,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:28,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:28,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2018-12-04 11:43:28,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:28,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:43:28,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:43:28,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2018-12-04 11:43:28,801 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2018-12-04 11:43:31,351 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-04 11:43:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:33,428 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-12-04 11:43:33,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-04 11:43:33,428 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2018-12-04 11:43:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:33,430 INFO L225 Difference]: With dead ends: 192 [2018-12-04 11:43:33,430 INFO L226 Difference]: Without dead ends: 113 [2018-12-04 11:43:33,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2018-12-04 11:43:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-04 11:43:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2018-12-04 11:43:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-04 11:43:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-04 11:43:33,443 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2018-12-04 11:43:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:33,444 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-04 11:43:33,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:43:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-04 11:43:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-04 11:43:33,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:33,444 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2018-12-04 11:43:33,444 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:33,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:33,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2018-12-04 11:43:33,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:33,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:33,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:34,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:34,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:34,656 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:34,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:34,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:34,657 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-04 11:43:34,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:34,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:34,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:34,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:34,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:35,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:35,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:35,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2018-12-04 11:43:35,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:35,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 11:43:35,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 11:43:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:35,157 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2018-12-04 11:43:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:37,340 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2018-12-04 11:43:37,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 11:43:37,343 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2018-12-04 11:43:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:37,344 INFO L225 Difference]: With dead ends: 169 [2018-12-04 11:43:37,344 INFO L226 Difference]: Without dead ends: 127 [2018-12-04 11:43:37,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:43:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-04 11:43:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-12-04 11:43:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-04 11:43:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-04 11:43:37,355 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2018-12-04 11:43:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:37,355 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-04 11:43:37,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 11:43:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-04 11:43:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-04 11:43:37,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:37,356 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2018-12-04 11:43:37,356 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:37,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2018-12-04 11:43:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:37,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:37,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:37,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:37,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:37,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:37,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:37,922 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-04 11:43:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:37,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:37,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:38,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:38,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:38,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2018-12-04 11:43:38,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:38,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 11:43:38,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 11:43:38,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:38,463 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2018-12-04 11:43:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:38,987 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2018-12-04 11:43:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:43:38,987 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-12-04 11:43:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:38,988 INFO L225 Difference]: With dead ends: 180 [2018-12-04 11:43:38,989 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 11:43:38,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:43:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 11:43:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-12-04 11:43:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 11:43:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-12-04 11:43:39,003 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2018-12-04 11:43:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:39,003 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-12-04 11:43:39,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 11:43:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-12-04 11:43:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 11:43:39,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:39,004 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2018-12-04 11:43:39,005 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:39,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2018-12-04 11:43:39,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:39,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:39,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:39,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:39,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:39,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:39,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:39,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:39,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:39,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:39,516 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-04 11:43:39,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:39,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:39,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 11:43:39,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:39,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:40,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:41,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:41,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2018-12-04 11:43:41,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:41,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:43:41,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:43:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2018-12-04 11:43:41,757 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2018-12-04 11:43:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:48,118 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2018-12-04 11:43:48,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-04 11:43:48,118 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2018-12-04 11:43:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:48,119 INFO L225 Difference]: With dead ends: 230 [2018-12-04 11:43:48,119 INFO L226 Difference]: Without dead ends: 135 [2018-12-04 11:43:48,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2018-12-04 11:43:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-04 11:43:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2018-12-04 11:43:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-04 11:43:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-12-04 11:43:48,137 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2018-12-04 11:43:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:48,137 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-12-04 11:43:48,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:43:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-12-04 11:43:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-04 11:43:48,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:48,138 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2018-12-04 11:43:48,138 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:48,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2018-12-04 11:43:48,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:48,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:48,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:48,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:48,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:48,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:48,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:48,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:48,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:48,817 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-04 11:43:48,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:48,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:48,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:48,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:48,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:49,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:49,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:49,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2018-12-04 11:43:49,448 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:49,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 11:43:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 11:43:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:43:49,449 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2018-12-04 11:43:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:52,502 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2018-12-04 11:43:52,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 11:43:52,503 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2018-12-04 11:43:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:52,504 INFO L225 Difference]: With dead ends: 199 [2018-12-04 11:43:52,504 INFO L226 Difference]: Without dead ends: 149 [2018-12-04 11:43:52,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-04 11:43:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2018-12-04 11:43:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-04 11:43:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-04 11:43:52,519 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2018-12-04 11:43:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:52,519 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-04 11:43:52,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 11:43:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-04 11:43:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-04 11:43:52,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:52,520 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2018-12-04 11:43:52,521 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:52,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:52,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2018-12-04 11:43:52,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:52,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:52,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:52,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:52,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:52,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:52,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:52,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:52,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:52,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:52,856 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-04 11:43:52,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:52,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:52,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:53,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:54,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:54,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2018-12-04 11:43:54,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:54,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 11:43:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 11:43:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:43:54,844 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2018-12-04 11:43:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:55,501 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-12-04 11:43:55,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 11:43:55,501 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2018-12-04 11:43:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:55,502 INFO L225 Difference]: With dead ends: 210 [2018-12-04 11:43:55,502 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 11:43:55,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:43:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 11:43:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-04 11:43:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 11:43:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-04 11:43:55,520 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2018-12-04 11:43:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:55,520 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-04 11:43:55,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 11:43:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-04 11:43:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 11:43:55,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:55,521 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2018-12-04 11:43:55,521 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:55,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2018-12-04 11:43:55,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:55,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:55,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:56,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:56,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:56,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:56,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:56,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:56,424 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-04 11:43:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:56,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:56,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-04 11:43:56,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:56,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:57,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:57,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2018-12-04 11:43:57,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:57,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:43:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:43:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2018-12-04 11:43:57,256 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2018-12-04 11:44:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:00,698 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2018-12-04 11:44:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-04 11:44:00,699 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2018-12-04 11:44:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:00,700 INFO L225 Difference]: With dead ends: 214 [2018-12-04 11:44:00,700 INFO L226 Difference]: Without dead ends: 160 [2018-12-04 11:44:00,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2018-12-04 11:44:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-04 11:44:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2018-12-04 11:44:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 11:44:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-04 11:44:00,718 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2018-12-04 11:44:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:00,718 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-04 11:44:00,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:44:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-04 11:44:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 11:44:00,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:00,718 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2018-12-04 11:44:00,719 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:00,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:00,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2018-12-04 11:44:00,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:00,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:00,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:00,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:00,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:01,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:01,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:01,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:01,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:01,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:01,140 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-04 11:44:01,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:01,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:01,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:01,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:01,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:01,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:01,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:01,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2018-12-04 11:44:01,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:01,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:44:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:44:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-12-04 11:44:01,849 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2018-12-04 11:44:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:02,477 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-12-04 11:44:02,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:44:02,480 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2018-12-04 11:44:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:02,482 INFO L225 Difference]: With dead ends: 225 [2018-12-04 11:44:02,482 INFO L226 Difference]: Without dead ends: 110 [2018-12-04 11:44:02,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:44:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-04 11:44:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-12-04 11:44:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-04 11:44:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-04 11:44:02,501 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2018-12-04 11:44:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:02,501 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-04 11:44:02,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:44:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-04 11:44:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-04 11:44:02,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:02,502 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2018-12-04 11:44:02,502 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2018-12-04 11:44:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:02,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:02,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:03,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:03,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:03,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:03,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:03,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:03,435 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-04 11:44:03,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:03,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:03,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:04,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:04,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:04,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2018-12-04 11:44:04,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:04,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 11:44:04,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 11:44:04,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:44:04,243 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2018-12-04 11:44:08,797 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-04 11:44:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:09,096 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2018-12-04 11:44:09,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-04 11:44:09,098 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2018-12-04 11:44:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:09,099 INFO L225 Difference]: With dead ends: 229 [2018-12-04 11:44:09,099 INFO L226 Difference]: Without dead ends: 171 [2018-12-04 11:44:09,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:44:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-04 11:44:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2018-12-04 11:44:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-04 11:44:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-04 11:44:09,122 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2018-12-04 11:44:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:09,122 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-04 11:44:09,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 11:44:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-04 11:44:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-04 11:44:09,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:09,123 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2018-12-04 11:44:09,123 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:09,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:09,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2018-12-04 11:44:09,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:09,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:09,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:09,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:09,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:09,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:09,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:09,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:09,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:09,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:09,546 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-04 11:44:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:09,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:09,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 11:44:09,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:09,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:10,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:10,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:10,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2018-12-04 11:44:10,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:10,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 11:44:10,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 11:44:10,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:44:10,365 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2018-12-04 11:44:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:10,906 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2018-12-04 11:44:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 11:44:10,906 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2018-12-04 11:44:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:10,907 INFO L225 Difference]: With dead ends: 240 [2018-12-04 11:44:10,907 INFO L226 Difference]: Without dead ends: 117 [2018-12-04 11:44:10,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:44:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-04 11:44:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-04 11:44:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-04 11:44:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-12-04 11:44:10,924 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2018-12-04 11:44:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:10,925 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-12-04 11:44:10,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 11:44:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-12-04 11:44:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-04 11:44:10,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:10,926 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2018-12-04 11:44:10,926 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:10,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:10,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2018-12-04 11:44:10,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:10,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:10,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:10,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:10,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:11,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:11,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:11,806 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:11,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:11,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:11,806 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-04 11:44:11,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:11,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:11,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:11,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:11,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:12,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:12,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:12,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2018-12-04 11:44:12,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:12,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:44:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:44:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2018-12-04 11:44:12,749 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2018-12-04 11:44:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:17,784 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2018-12-04 11:44:17,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-04 11:44:17,787 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2018-12-04 11:44:17,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:17,789 INFO L225 Difference]: With dead ends: 244 [2018-12-04 11:44:17,789 INFO L226 Difference]: Without dead ends: 182 [2018-12-04 11:44:17,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2018-12-04 11:44:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-04 11:44:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2018-12-04 11:44:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-04 11:44:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-12-04 11:44:17,812 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2018-12-04 11:44:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:17,813 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-12-04 11:44:17,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:44:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-12-04 11:44:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-04 11:44:17,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:17,814 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2018-12-04 11:44:17,814 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:17,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2018-12-04 11:44:17,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:17,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:17,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:18,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:18,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:18,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:18,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:18,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:18,351 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-04 11:44:18,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:18,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:18,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:19,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:19,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:19,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2018-12-04 11:44:19,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:19,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:44:19,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:44:19,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-12-04 11:44:19,487 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2018-12-04 11:44:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:20,389 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2018-12-04 11:44:20,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 11:44:20,389 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2018-12-04 11:44:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:20,391 INFO L225 Difference]: With dead ends: 255 [2018-12-04 11:44:20,391 INFO L226 Difference]: Without dead ends: 124 [2018-12-04 11:44:20,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:44:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-04 11:44:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-12-04 11:44:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-04 11:44:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-04 11:44:20,411 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2018-12-04 11:44:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:20,412 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-04 11:44:20,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:44:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-04 11:44:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-04 11:44:20,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:20,412 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2018-12-04 11:44:20,413 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:20,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2018-12-04 11:44:20,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:20,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:20,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:21,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:21,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:21,488 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:21,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:21,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:21,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:21,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:21,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-04 11:44:21,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:21,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:23,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:25,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:25,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2018-12-04 11:44:25,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:25,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-04 11:44:25,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-04 11:44:25,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:25,521 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2018-12-04 11:44:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:35,601 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2018-12-04 11:44:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-04 11:44:35,601 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2018-12-04 11:44:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:35,603 INFO L225 Difference]: With dead ends: 325 [2018-12-04 11:44:35,603 INFO L226 Difference]: Without dead ends: 190 [2018-12-04 11:44:35,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 11:44:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-04 11:44:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2018-12-04 11:44:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-04 11:44:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-12-04 11:44:35,626 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2018-12-04 11:44:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:35,626 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-12-04 11:44:35,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-04 11:44:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-12-04 11:44:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-04 11:44:35,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:35,627 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2018-12-04 11:44:35,628 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:35,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:35,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2018-12-04 11:44:35,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:35,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:35,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:35,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:35,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:36,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:36,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:36,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:36,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:36,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:36,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:36,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:36,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:36,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:36,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:36,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:37,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:37,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:37,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2018-12-04 11:44:37,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:37,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 11:44:37,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 11:44:37,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2018-12-04 11:44:37,799 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2018-12-04 11:44:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:43,305 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2018-12-04 11:44:43,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-04 11:44:43,306 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2018-12-04 11:44:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:43,308 INFO L225 Difference]: With dead ends: 274 [2018-12-04 11:44:43,308 INFO L226 Difference]: Without dead ends: 204 [2018-12-04 11:44:43,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2018-12-04 11:44:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-04 11:44:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2018-12-04 11:44:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-04 11:44:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-12-04 11:44:43,335 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2018-12-04 11:44:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:43,336 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-12-04 11:44:43,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 11:44:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-12-04 11:44:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-04 11:44:43,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:43,336 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2018-12-04 11:44:43,337 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:43,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2018-12-04 11:44:43,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:43,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:43,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:44,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:44,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:44,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:44,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:44,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:44,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:44,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:44,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:44,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:44,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:45,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:45,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2018-12-04 11:44:45,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:45,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 11:44:45,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 11:44:45,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2018-12-04 11:44:45,342 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2018-12-04 11:44:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:46,232 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2018-12-04 11:44:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 11:44:46,233 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2018-12-04 11:44:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:46,234 INFO L225 Difference]: With dead ends: 285 [2018-12-04 11:44:46,234 INFO L226 Difference]: Without dead ends: 138 [2018-12-04 11:44:46,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:44:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-04 11:44:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-12-04 11:44:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-04 11:44:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-04 11:44:46,261 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2018-12-04 11:44:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:46,262 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-04 11:44:46,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 11:44:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-04 11:44:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-04 11:44:46,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:46,262 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2018-12-04 11:44:46,263 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:46,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:46,263 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2018-12-04 11:44:46,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:46,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:46,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:47,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:47,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:47,409 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:47,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:47,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:47,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:47,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:47,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:47,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 11:44:47,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:47,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:49,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:52,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:52,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2018-12-04 11:44:52,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:52,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-04 11:44:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-04 11:44:52,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:44:52,151 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2018-12-04 11:45:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:05,325 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2018-12-04 11:45:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-12-04 11:45:05,325 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2018-12-04 11:45:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:05,327 INFO L225 Difference]: With dead ends: 363 [2018-12-04 11:45:05,327 INFO L226 Difference]: Without dead ends: 212 [2018-12-04 11:45:05,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2018-12-04 11:45:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-04 11:45:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2018-12-04 11:45:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-04 11:45:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-12-04 11:45:05,357 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2018-12-04 11:45:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:05,357 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-12-04 11:45:05,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-04 11:45:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-12-04 11:45:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-04 11:45:05,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:05,358 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2018-12-04 11:45:05,358 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:05,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2018-12-04 11:45:05,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:05,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:05,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:06,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:06,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:06,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:06,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:06,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:06,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:45:06,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:06,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:06,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:06,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:06,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:09,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:09,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:09,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2018-12-04 11:45:09,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:09,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 11:45:09,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 11:45:09,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2018-12-04 11:45:09,613 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2018-12-04 11:45:13,864 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-04 11:45:14,140 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-04 11:45:14,398 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-04 11:45:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:16,215 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2018-12-04 11:45:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-04 11:45:16,215 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2018-12-04 11:45:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:16,217 INFO L225 Difference]: With dead ends: 304 [2018-12-04 11:45:16,217 INFO L226 Difference]: Without dead ends: 226 [2018-12-04 11:45:16,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2018-12-04 11:45:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-04 11:45:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2018-12-04 11:45:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-04 11:45:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-12-04 11:45:16,243 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2018-12-04 11:45:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:16,243 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-12-04 11:45:16,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 11:45:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-12-04 11:45:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-04 11:45:16,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:16,244 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2018-12-04 11:45:16,244 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:16,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:16,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2018-12-04 11:45:16,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:16,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:16,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:16,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:17,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:17,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:17,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:17,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:17,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:17,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:45:17,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:17,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:17,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:17,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:18,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:18,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2018-12-04 11:45:18,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:18,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 11:45:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 11:45:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2018-12-04 11:45:18,514 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2018-12-04 11:45:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:19,817 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2018-12-04 11:45:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 11:45:19,818 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2018-12-04 11:45:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:19,819 INFO L225 Difference]: With dead ends: 315 [2018-12-04 11:45:19,819 INFO L226 Difference]: Without dead ends: 152 [2018-12-04 11:45:19,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:45:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-04 11:45:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-12-04 11:45:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-04 11:45:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-04 11:45:19,856 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2018-12-04 11:45:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:19,856 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-04 11:45:19,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 11:45:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-04 11:45:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-04 11:45:19,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:19,857 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2018-12-04 11:45:19,857 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:19,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:19,858 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2018-12-04 11:45:19,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:19,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:19,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:22,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:22,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:22,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:22,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:22,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:22,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:45:22,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:22,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:22,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 11:45:22,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:22,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:25,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:27,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:27,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2018-12-04 11:45:27,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:27,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-04 11:45:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-04 11:45:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:45:27,840 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2018-12-04 11:45:39,146 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-04 11:45:39,447 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-04 11:45:39,753 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-04 11:45:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:42,620 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2018-12-04 11:45:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-12-04 11:45:42,620 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2018-12-04 11:45:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:42,622 INFO L225 Difference]: With dead ends: 401 [2018-12-04 11:45:42,622 INFO L226 Difference]: Without dead ends: 234 [2018-12-04 11:45:42,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2018-12-04 11:45:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-04 11:45:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2018-12-04 11:45:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-04 11:45:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-12-04 11:45:42,653 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2018-12-04 11:45:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:42,653 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-12-04 11:45:42,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-04 11:45:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-12-04 11:45:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-04 11:45:42,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:42,654 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2018-12-04 11:45:42,654 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:42,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2018-12-04 11:45:42,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:42,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:42,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:42,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:42,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:44,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:44,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:44,342 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:44,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:44,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:44,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:45:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:44,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:44,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:44,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:44,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:45,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:45,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:45,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2018-12-04 11:45:45,914 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:45,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 11:45:45,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 11:45:45,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2018-12-04 11:45:45,916 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2018-12-04 11:45:51,556 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-04 11:45:51,858 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-04 11:45:52,145 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-04 11:45:52,337 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:45:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:54,447 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2018-12-04 11:45:54,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-04 11:45:54,448 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2018-12-04 11:45:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:54,450 INFO L225 Difference]: With dead ends: 334 [2018-12-04 11:45:54,450 INFO L226 Difference]: Without dead ends: 248 [2018-12-04 11:45:54,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2018-12-04 11:45:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-04 11:45:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2018-12-04 11:45:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-04 11:45:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-12-04 11:45:54,493 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2018-12-04 11:45:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:54,493 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-12-04 11:45:54,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 11:45:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-12-04 11:45:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-04 11:45:54,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:54,495 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2018-12-04 11:45:54,495 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:54,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:54,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2018-12-04 11:45:54,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:54,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:54,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:54,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:54,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:55,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:55,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:55,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:55,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:55,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:55,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:45:55,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:55,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:55,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:56,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:57,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:57,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2018-12-04 11:45:57,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:57,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 11:45:57,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 11:45:57,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2018-12-04 11:45:57,514 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2018-12-04 11:45:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:59,063 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2018-12-04 11:45:59,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 11:45:59,065 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2018-12-04 11:45:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:59,066 INFO L225 Difference]: With dead ends: 345 [2018-12-04 11:45:59,066 INFO L226 Difference]: Without dead ends: 166 [2018-12-04 11:45:59,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:45:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-04 11:45:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-12-04 11:45:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-04 11:45:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-04 11:45:59,096 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2018-12-04 11:45:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:59,096 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-04 11:45:59,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 11:45:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-04 11:45:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-04 11:45:59,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:59,097 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2018-12-04 11:45:59,097 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:59,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2018-12-04 11:45:59,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:59,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:59,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:00,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:00,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:00,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:00,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:00,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:00,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:46:00,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:00,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:00,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-04 11:46:00,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:00,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:02,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:02,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:02,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2018-12-04 11:46:02,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:02,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-04 11:46:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-04 11:46:02,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:46:02,373 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2018-12-04 11:46:09,094 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-04 11:46:09,412 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-04 11:46:09,714 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-04 11:46:09,912 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:46:10,113 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:46:10,303 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:46:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:12,290 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2018-12-04 11:46:12,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-04 11:46:12,290 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2018-12-04 11:46:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:12,291 INFO L225 Difference]: With dead ends: 349 [2018-12-04 11:46:12,291 INFO L226 Difference]: Without dead ends: 259 [2018-12-04 11:46:12,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 11:46:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-04 11:46:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2018-12-04 11:46:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-04 11:46:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-12-04 11:46:12,330 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2018-12-04 11:46:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:12,330 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-12-04 11:46:12,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-04 11:46:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-12-04 11:46:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-04 11:46:12,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:12,331 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2018-12-04 11:46:12,331 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:12,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:12,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2018-12-04 11:46:12,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:12,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:12,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:12,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:13,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:13,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:13,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:13,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:13,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:13,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:46:13,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:13,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:13,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:13,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:13,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:14,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:15,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:15,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2018-12-04 11:46:15,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:15,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-04 11:46:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-04 11:46:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:46:15,012 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2018-12-04 11:46:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:16,807 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2018-12-04 11:46:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 11:46:16,808 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2018-12-04 11:46:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:16,809 INFO L225 Difference]: With dead ends: 360 [2018-12-04 11:46:16,809 INFO L226 Difference]: Without dead ends: 173 [2018-12-04 11:46:16,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:46:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-04 11:46:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-12-04 11:46:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-04 11:46:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-12-04 11:46:16,842 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2018-12-04 11:46:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:16,842 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-12-04 11:46:16,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-04 11:46:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-12-04 11:46:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-04 11:46:16,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:16,843 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2018-12-04 11:46:16,843 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:16,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:16,843 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2018-12-04 11:46:16,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:16,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:16,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:16,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:16,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:18,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:18,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:18,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:18,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:18,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:18,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:46:18,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:18,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:46:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:18,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:19,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:20,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:20,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2018-12-04 11:46:20,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:20,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 11:46:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 11:46:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2018-12-04 11:46:20,155 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2018-12-04 11:46:27,220 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-04 11:46:27,567 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-04 11:46:27,907 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-04 11:46:28,136 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:46:28,348 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:46:28,561 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:46:28,763 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:46:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:30,896 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2018-12-04 11:46:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-04 11:46:30,897 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2018-12-04 11:46:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:30,898 INFO L225 Difference]: With dead ends: 364 [2018-12-04 11:46:30,899 INFO L226 Difference]: Without dead ends: 270 [2018-12-04 11:46:30,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2018-12-04 11:46:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-04 11:46:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2018-12-04 11:46:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-04 11:46:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-12-04 11:46:30,931 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2018-12-04 11:46:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:30,931 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-12-04 11:46:30,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 11:46:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-12-04 11:46:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-04 11:46:30,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:30,932 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2018-12-04 11:46:30,932 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:30,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2018-12-04 11:46:30,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:30,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:30,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:30,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:30,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:32,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:32,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:32,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:32,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:32,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:32,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:46:32,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:32,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:32,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 11:46:32,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:32,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:33,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:34,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:34,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2018-12-04 11:46:34,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:34,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 11:46:34,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 11:46:34,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2018-12-04 11:46:34,331 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2018-12-04 11:46:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:36,155 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2018-12-04 11:46:36,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 11:46:36,156 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2018-12-04 11:46:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:36,157 INFO L225 Difference]: With dead ends: 375 [2018-12-04 11:46:36,157 INFO L226 Difference]: Without dead ends: 180 [2018-12-04 11:46:36,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:46:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-04 11:46:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-12-04 11:46:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-04 11:46:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2018-12-04 11:46:36,193 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2018-12-04 11:46:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:36,193 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2018-12-04 11:46:36,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 11:46:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-12-04 11:46:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-04 11:46:36,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:36,194 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2018-12-04 11:46:36,194 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:36,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2018-12-04 11:46:36,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:36,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:36,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:38,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:38,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:38,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:38,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:38,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:38,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:46:38,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:38,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:38,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:38,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:38,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:39,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:40,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:40,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2018-12-04 11:46:40,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:40,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-04 11:46:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-04 11:46:40,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:46:40,098 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2018-12-04 11:46:46,114 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-04 11:46:46,469 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-04 11:46:46,818 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-04 11:46:47,055 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:46:47,281 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:46:47,504 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:46:47,721 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:46:47,920 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:46:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:50,106 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2018-12-04 11:46:50,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-04 11:46:50,107 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2018-12-04 11:46:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:50,109 INFO L225 Difference]: With dead ends: 379 [2018-12-04 11:46:50,109 INFO L226 Difference]: Without dead ends: 281 [2018-12-04 11:46:50,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 11:46:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-04 11:46:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2018-12-04 11:46:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-04 11:46:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-12-04 11:46:50,153 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2018-12-04 11:46:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:50,154 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-12-04 11:46:50,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-04 11:46:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-12-04 11:46:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-04 11:46:50,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:50,155 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2018-12-04 11:46:50,155 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:50,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2018-12-04 11:46:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:50,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:50,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:51,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:51,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:51,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:51,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:51,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:51,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:46:51,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:51,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:46:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:51,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:52,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:53,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:53,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2018-12-04 11:46:53,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:53,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-04 11:46:53,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-04 11:46:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:46:53,232 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2018-12-04 11:46:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:55,152 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2018-12-04 11:46:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 11:46:55,152 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2018-12-04 11:46:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:55,153 INFO L225 Difference]: With dead ends: 390 [2018-12-04 11:46:55,153 INFO L226 Difference]: Without dead ends: 187 [2018-12-04 11:46:55,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:46:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-04 11:46:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-12-04 11:46:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-04 11:46:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2018-12-04 11:46:55,196 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2018-12-04 11:46:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:55,196 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2018-12-04 11:46:55,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-04 11:46:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2018-12-04 11:46:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-04 11:46:55,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:55,197 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2018-12-04 11:46:55,197 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:55,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2018-12-04 11:46:55,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:55,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:55,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:55,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:55,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:57,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:57,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:57,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:57,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:57,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:57,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:46:57,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:57,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:57,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-04 11:46:57,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:57,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:01,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:05,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:05,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2018-12-04 11:47:05,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:05,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-04 11:47:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-04 11:47:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2018-12-04 11:47:05,721 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2018-12-04 11:47:22,644 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-04 11:47:23,079 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-04 11:47:23,537 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-04 11:47:23,915 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:47:24,278 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:47:24,637 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:47:24,982 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:47:25,321 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:47:25,634 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:47:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:28,834 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2018-12-04 11:47:28,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-12-04 11:47:28,834 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2018-12-04 11:47:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:28,836 INFO L225 Difference]: With dead ends: 496 [2018-12-04 11:47:28,836 INFO L226 Difference]: Without dead ends: 289 [2018-12-04 11:47:28,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2018-12-04 11:47:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-04 11:47:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2018-12-04 11:47:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-04 11:47:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-12-04 11:47:28,881 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2018-12-04 11:47:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:28,881 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-12-04 11:47:28,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-04 11:47:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-12-04 11:47:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-04 11:47:28,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:28,882 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2018-12-04 11:47:28,882 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:28,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2018-12-04 11:47:28,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:28,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:28,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:30,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:30,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:30,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:30,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:30,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:30,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:47:30,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:47:30,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:47:30,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:47:30,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:30,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:32,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:32,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:32,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2018-12-04 11:47:32,917 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:32,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-04 11:47:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-04 11:47:32,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:47:32,918 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2018-12-04 11:47:40,863 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-04 11:47:41,275 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-04 11:47:41,667 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-04 11:47:41,933 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:47:42,197 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:47:42,453 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:47:42,696 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:47:42,935 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:47:43,159 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:47:43,377 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:47:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:45,706 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2018-12-04 11:47:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-04 11:47:45,706 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2018-12-04 11:47:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:45,708 INFO L225 Difference]: With dead ends: 409 [2018-12-04 11:47:45,708 INFO L226 Difference]: Without dead ends: 303 [2018-12-04 11:47:45,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 11:47:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-04 11:47:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2018-12-04 11:47:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-04 11:47:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-12-04 11:47:45,751 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2018-12-04 11:47:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:45,751 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-12-04 11:47:45,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-04 11:47:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-12-04 11:47:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-04 11:47:45,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:45,752 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2018-12-04 11:47:45,752 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:45,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2018-12-04 11:47:45,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:45,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:45,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:46,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:46,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:46,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:46,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:46,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:46,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:47:46,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:46,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:47:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:46,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:48,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:49,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:49,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2018-12-04 11:47:49,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:49,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-04 11:47:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-04 11:47:49,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:47:49,147 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2018-12-04 11:47:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:51,437 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2018-12-04 11:47:51,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-04 11:47:51,437 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2018-12-04 11:47:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:51,439 INFO L225 Difference]: With dead ends: 420 [2018-12-04 11:47:51,439 INFO L226 Difference]: Without dead ends: 201 [2018-12-04 11:47:51,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:47:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-04 11:47:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-12-04 11:47:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-04 11:47:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2018-12-04 11:47:51,479 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2018-12-04 11:47:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:51,479 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2018-12-04 11:47:51,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-04 11:47:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2018-12-04 11:47:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-04 11:47:51,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:51,480 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2018-12-04 11:47:51,480 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:51,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2018-12-04 11:47:51,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:51,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:51,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:51,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:53,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:53,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:53,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:53,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:53,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:53,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:47:53,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:47:53,586 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:47:53,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-04 11:47:53,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:53,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:55,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:55,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:55,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2018-12-04 11:47:55,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:55,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 11:47:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 11:47:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2018-12-04 11:47:55,831 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2018-12-04 11:48:03,839 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-04 11:48:04,280 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-04 11:48:04,679 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-04 11:48:04,961 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:48:05,236 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:48:05,503 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:48:05,753 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:48:06,004 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:48:06,238 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:48:06,475 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:48:06,703 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:48:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:09,098 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2018-12-04 11:48:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-04 11:48:09,099 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2018-12-04 11:48:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:09,100 INFO L225 Difference]: With dead ends: 424 [2018-12-04 11:48:09,100 INFO L226 Difference]: Without dead ends: 314 [2018-12-04 11:48:09,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2018-12-04 11:48:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-04 11:48:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2018-12-04 11:48:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-04 11:48:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2018-12-04 11:48:09,151 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2018-12-04 11:48:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:09,151 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2018-12-04 11:48:09,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 11:48:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2018-12-04 11:48:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-04 11:48:09,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:09,152 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2018-12-04 11:48:09,153 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:09,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:09,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2018-12-04 11:48:09,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:09,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:09,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:09,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:09,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:10,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:10,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:10,324 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:10,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:10,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:10,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:48:10,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:48:10,334 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:48:10,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:48:10,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:10,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:11,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:12,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:12,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2018-12-04 11:48:12,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:12,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 11:48:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 11:48:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2018-12-04 11:48:12,780 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2018-12-04 11:48:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:15,263 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2018-12-04 11:48:15,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-04 11:48:15,264 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2018-12-04 11:48:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:15,265 INFO L225 Difference]: With dead ends: 435 [2018-12-04 11:48:15,265 INFO L226 Difference]: Without dead ends: 208 [2018-12-04 11:48:15,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:48:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-04 11:48:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-12-04 11:48:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-04 11:48:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-12-04 11:48:15,319 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2018-12-04 11:48:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:15,319 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-12-04 11:48:15,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 11:48:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-12-04 11:48:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-04 11:48:15,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:15,320 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2018-12-04 11:48:15,320 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:15,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2018-12-04 11:48:15,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:15,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:15,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:17,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:17,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:17,535 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:17,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:17,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:17,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:48:17,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:17,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:48:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:17,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:19,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:19,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:19,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2018-12-04 11:48:19,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:19,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-04 11:48:19,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-04 11:48:19,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:48:19,950 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2018-12-04 11:48:28,646 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-04 11:48:29,087 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-04 11:48:29,525 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-04 11:48:29,859 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:48:30,152 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:48:30,437 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:48:30,712 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:48:30,979 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:48:31,230 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:48:31,482 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:48:31,719 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:48:31,943 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:48:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:34,410 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2018-12-04 11:48:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-04 11:48:34,411 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2018-12-04 11:48:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:34,413 INFO L225 Difference]: With dead ends: 439 [2018-12-04 11:48:34,413 INFO L226 Difference]: Without dead ends: 325 [2018-12-04 11:48:34,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 11:48:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-04 11:48:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2018-12-04 11:48:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-04 11:48:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-12-04 11:48:34,468 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2018-12-04 11:48:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:34,468 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-12-04 11:48:34,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-04 11:48:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-12-04 11:48:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-04 11:48:34,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:34,470 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2018-12-04 11:48:34,470 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:34,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2018-12-04 11:48:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:34,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:34,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:34,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:34,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:35,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:35,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:35,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:35,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:35,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:35,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:48:35,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:48:35,717 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:48:35,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-04 11:48:35,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:35,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:37,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:38,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:38,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2018-12-04 11:48:38,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:38,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-04 11:48:38,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-04 11:48:38,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:48:38,372 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2018-12-04 11:48:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:40,957 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2018-12-04 11:48:40,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-04 11:48:40,958 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2018-12-04 11:48:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:40,959 INFO L225 Difference]: With dead ends: 450 [2018-12-04 11:48:40,960 INFO L226 Difference]: Without dead ends: 215 [2018-12-04 11:48:40,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:48:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-04 11:48:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-04 11:48:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-04 11:48:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2018-12-04 11:48:41,015 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2018-12-04 11:48:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:41,015 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2018-12-04 11:48:41,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-04 11:48:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2018-12-04 11:48:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-04 11:48:41,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:41,016 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2018-12-04 11:48:41,017 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:41,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:41,017 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2018-12-04 11:48:41,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:41,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:41,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:41,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:41,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:43,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:43,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:43,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:43,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:43,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:43,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:48:43,136 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:48:43,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:48:43,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:48:43,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:43,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:45,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:45,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:45,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2018-12-04 11:48:45,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:45,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 11:48:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 11:48:45,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2018-12-04 11:48:45,921 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2018-12-04 11:48:55,783 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-04 11:48:56,242 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-04 11:48:56,701 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-04 11:48:57,014 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:48:57,321 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:48:57,616 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:48:57,912 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:48:58,194 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:48:58,473 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:48:58,739 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:48:58,997 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:48:59,236 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:49:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:01,947 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2018-12-04 11:49:01,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-04 11:49:01,947 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2018-12-04 11:49:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:01,948 INFO L225 Difference]: With dead ends: 454 [2018-12-04 11:49:01,949 INFO L226 Difference]: Without dead ends: 336 [2018-12-04 11:49:01,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2018-12-04 11:49:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-04 11:49:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2018-12-04 11:49:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-04 11:49:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2018-12-04 11:49:02,005 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2018-12-04 11:49:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:02,006 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2018-12-04 11:49:02,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 11:49:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2018-12-04 11:49:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-04 11:49:02,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:02,007 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2018-12-04 11:49:02,007 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:02,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:02,007 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2018-12-04 11:49:02,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:02,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:02,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:02,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:02,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:03,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:03,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:03,255 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:03,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:03,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:03,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:49:03,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:03,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:49:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:03,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:04,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:06,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:06,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2018-12-04 11:49:06,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:06,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 11:49:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 11:49:06,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2018-12-04 11:49:06,025 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2018-12-04 11:49:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:08,739 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2018-12-04 11:49:08,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-04 11:49:08,739 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2018-12-04 11:49:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:08,741 INFO L225 Difference]: With dead ends: 465 [2018-12-04 11:49:08,741 INFO L226 Difference]: Without dead ends: 222 [2018-12-04 11:49:08,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:49:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-04 11:49:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-12-04 11:49:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-04 11:49:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-12-04 11:49:08,788 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2018-12-04 11:49:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:08,788 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-12-04 11:49:08,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 11:49:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-12-04 11:49:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-04 11:49:08,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:08,789 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2018-12-04 11:49:08,789 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:08,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:08,789 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2018-12-04 11:49:08,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:08,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:08,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:08,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:08,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:11,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:11,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:11,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:11,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:11,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:11,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:49:11,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:49:11,110 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:49:11,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-04 11:49:11,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:11,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:17,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:22,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:22,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2018-12-04 11:49:22,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:22,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-04 11:49:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-04 11:49:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 11:49:22,438 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2018-12-04 11:49:45,565 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-04 11:49:46,136 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-04 11:49:46,741 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-04 11:49:47,240 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 11:49:47,713 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:49:48,177 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:49:48,631 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:49:49,062 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:49:49,496 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:49:49,903 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:49:50,293 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:49:50,665 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:49:51,019 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:49:51,359 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:49:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:54,919 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2018-12-04 11:49:54,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-12-04 11:49:54,920 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2018-12-04 11:49:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:54,921 INFO L225 Difference]: With dead ends: 591 [2018-12-04 11:49:54,921 INFO L226 Difference]: Without dead ends: 344 [2018-12-04 11:49:54,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2018-12-04 11:49:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-04 11:49:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2018-12-04 11:49:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-04 11:49:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2018-12-04 11:49:54,976 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2018-12-04 11:49:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:54,976 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2018-12-04 11:49:54,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-04 11:49:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2018-12-04 11:49:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-04 11:49:54,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:54,977 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2018-12-04 11:49:54,977 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:54,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2018-12-04 11:49:54,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:54,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:54,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:54,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:54,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:57,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:57,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:57,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:57,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:57,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:57,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:49:57,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:49:57,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:49:57,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:49:57,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:57,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:59,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:00,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:00,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2018-12-04 11:50:00,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:00,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 11:50:00,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 11:50:00,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2018-12-04 11:50:00,154 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2018-12-04 11:50:12,609 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-04 11:50:13,110 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-04 11:50:13,618 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-04 11:50:13,960 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 11:50:14,294 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 11:50:14,625 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:50:14,953 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:50:15,257 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:50:15,552 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:50:15,843 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:50:16,121 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:50:16,391 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:50:16,650 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:50:16,896 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:50:17,145 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:50:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:19,799 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2018-12-04 11:50:19,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-04 11:50:19,799 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2018-12-04 11:50:19,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:19,801 INFO L225 Difference]: With dead ends: 484 [2018-12-04 11:50:19,801 INFO L226 Difference]: Without dead ends: 358 [2018-12-04 11:50:19,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2018-12-04 11:50:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-04 11:50:19,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2018-12-04 11:50:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-04 11:50:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-12-04 11:50:19,857 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2018-12-04 11:50:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:19,857 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-12-04 11:50:19,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 11:50:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2018-12-04 11:50:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-04 11:50:19,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:19,859 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2018-12-04 11:50:19,859 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:19,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2018-12-04 11:50:19,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:19,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:19,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:19,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:19,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:21,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:21,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:21,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:21,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:21,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:21,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:50:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:50:21,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:50:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:21,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:24,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:26,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:26,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2018-12-04 11:50:26,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:26,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 11:50:26,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 11:50:26,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2018-12-04 11:50:26,269 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2018-12-04 11:50:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:28,611 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2018-12-04 11:50:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-04 11:50:28,612 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2018-12-04 11:50:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:28,613 INFO L225 Difference]: With dead ends: 495 [2018-12-04 11:50:28,613 INFO L226 Difference]: Without dead ends: 236 [2018-12-04 11:50:28,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 11:50:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-04 11:50:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-12-04 11:50:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-04 11:50:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2018-12-04 11:50:28,676 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2018-12-04 11:50:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:28,677 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2018-12-04 11:50:28,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 11:50:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2018-12-04 11:50:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-04 11:50:28,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:28,678 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2018-12-04 11:50:28,678 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:28,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2018-12-04 11:50:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:28,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:50:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:28,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:31,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:31,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:31,214 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:31,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:31,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:31,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:50:31,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:50:31,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:50:31,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-04 11:50:31,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:31,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:37,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:43,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:43,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2018-12-04 11:50:43,903 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:43,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-12-04 11:50:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-12-04 11:50:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 11:50:43,905 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2018-12-04 11:51:08,370 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-04 11:51:08,987 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-04 11:51:09,596 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-04 11:51:10,136 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 11:51:10,655 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 11:51:11,184 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 11:51:11,677 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:51:12,160 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:51:12,624 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:51:13,100 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:51:13,565 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:51:14,006 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:51:14,421 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:51:14,817 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:51:15,197 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:51:15,580 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:51:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:19,304 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2018-12-04 11:51:19,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-12-04 11:51:19,305 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2018-12-04 11:51:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:19,307 INFO L225 Difference]: With dead ends: 629 [2018-12-04 11:51:19,307 INFO L226 Difference]: Without dead ends: 366 [2018-12-04 11:51:19,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2018-12-04 11:51:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-04 11:51:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2018-12-04 11:51:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-04 11:51:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2018-12-04 11:51:19,387 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2018-12-04 11:51:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:19,387 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2018-12-04 11:51:19,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-12-04 11:51:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2018-12-04 11:51:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-04 11:51:19,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:19,388 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2018-12-04 11:51:19,389 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:19,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2018-12-04 11:51:19,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:19,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:19,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:51:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:19,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:22,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:22,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:22,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:22,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:22,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:22,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:51:22,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:51:22,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:51:22,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:51:22,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:22,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:24,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:25,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:25,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2018-12-04 11:51:25,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:25,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 11:51:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 11:51:25,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2018-12-04 11:51:25,262 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2018-12-04 11:51:36,882 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-04 11:51:37,430 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-04 11:51:37,951 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-04 11:51:38,318 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 11:51:38,673 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 11:51:39,040 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 11:51:39,390 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 11:51:39,723 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:51:40,065 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:51:40,379 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:51:40,689 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:51:40,998 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:51:41,289 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:51:41,579 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:51:41,855 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:51:42,115 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:51:42,372 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:51:42,889 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-04 11:51:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:45,200 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2018-12-04 11:51:45,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-12-04 11:51:45,200 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2018-12-04 11:51:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:45,202 INFO L225 Difference]: With dead ends: 514 [2018-12-04 11:51:45,202 INFO L226 Difference]: Without dead ends: 380 [2018-12-04 11:51:45,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2018-12-04 11:51:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-04 11:51:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2018-12-04 11:51:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-04 11:51:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2018-12-04 11:51:45,267 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2018-12-04 11:51:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:45,267 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2018-12-04 11:51:45,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 11:51:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2018-12-04 11:51:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-04 11:51:45,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:45,268 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2018-12-04 11:51:45,268 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:45,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:45,268 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2018-12-04 11:51:45,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:45,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:51:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:45,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:46,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:46,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:46,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:46,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:46,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:46,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:51:46,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:46,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:51:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:46,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:48,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:50,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:50,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2018-12-04 11:51:50,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:50,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 11:51:50,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 11:51:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2018-12-04 11:51:50,300 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2018-12-04 11:51:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:52,854 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2018-12-04 11:51:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-04 11:51:52,855 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2018-12-04 11:51:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:52,856 INFO L225 Difference]: With dead ends: 525 [2018-12-04 11:51:52,856 INFO L226 Difference]: Without dead ends: 250 [2018-12-04 11:51:52,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 11:51:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-04 11:51:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-12-04 11:51:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-04 11:51:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2018-12-04 11:51:52,926 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2018-12-04 11:51:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:52,926 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2018-12-04 11:51:52,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 11:51:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2018-12-04 11:51:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-04 11:51:52,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:52,928 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2018-12-04 11:51:52,928 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:52,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2018-12-04 11:51:52,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:52,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:52,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:55,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:55,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:55,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:55,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:55,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:55,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:51:55,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:51:55,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:51:55,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-04 11:51:55,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:55,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:03,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:10,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:10,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2018-12-04 11:52:10,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:10,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-12-04 11:52:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-12-04 11:52:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 11:52:10,018 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2018-12-04 11:52:36,608 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-04 11:52:37,268 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-04 11:52:37,907 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-04 11:52:38,508 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-04 11:52:39,118 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 11:52:39,696 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 11:52:40,250 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 11:52:40,801 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 11:52:41,343 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:52:41,864 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:52:42,364 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:52:42,856 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:52:43,334 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:52:43,805 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:52:44,241 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:52:44,656 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:52:45,053 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:52:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:49,487 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2018-12-04 11:52:49,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2018-12-04 11:52:49,487 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2018-12-04 11:52:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:49,489 INFO L225 Difference]: With dead ends: 667 [2018-12-04 11:52:49,490 INFO L226 Difference]: Without dead ends: 388 [2018-12-04 11:52:49,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2018-12-04 11:52:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-04 11:52:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2018-12-04 11:52:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-04 11:52:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-12-04 11:52:49,564 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2018-12-04 11:52:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:49,564 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-12-04 11:52:49,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-12-04 11:52:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-12-04 11:52:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-04 11:52:49,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:49,566 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2018-12-04 11:52:49,566 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:49,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2018-12-04 11:52:49,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:49,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:49,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:52:49,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:49,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:52,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:52,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:52,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:52,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:52:52,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:52,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:52:52,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:52:52,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:52:52,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:52:52,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:52:52,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:55,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:56,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:56,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2018-12-04 11:52:56,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:56,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-04 11:52:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-04 11:52:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2018-12-04 11:52:56,062 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2018-12-04 11:53:09,725 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-04 11:53:10,285 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-04 11:53:10,842 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-04 11:53:11,243 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-04 11:53:11,657 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-04 11:53:12,045 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 11:53:12,415 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 11:53:12,789 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 11:53:13,144 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 11:53:13,499 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:53:13,841 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:53:14,176 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:53:14,519 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:53:14,841 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:53:15,147 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:53:15,443 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:53:15,728 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:53:16,003 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:53:16,270 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:53:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:19,173 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2018-12-04 11:53:19,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-12-04 11:53:19,174 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2018-12-04 11:53:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:19,175 INFO L225 Difference]: With dead ends: 544 [2018-12-04 11:53:19,175 INFO L226 Difference]: Without dead ends: 402 [2018-12-04 11:53:19,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2018-12-04 11:53:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-04 11:53:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2018-12-04 11:53:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-04 11:53:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2018-12-04 11:53:19,243 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2018-12-04 11:53:19,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:19,244 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2018-12-04 11:53:19,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-04 11:53:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2018-12-04 11:53:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-04 11:53:19,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:19,245 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2018-12-04 11:53:19,245 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:19,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:19,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2018-12-04 11:53:19,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:19,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:53:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:19,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:20,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:20,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:20,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:20,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:53:20,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:20,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:53:21,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:53:21,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:53:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:21,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:23,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:24,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:24,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2018-12-04 11:53:24,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:24,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-04 11:53:24,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-04 11:53:24,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2018-12-04 11:53:24,835 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2018-12-04 11:53:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:27,724 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2018-12-04 11:53:27,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-04 11:53:27,725 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2018-12-04 11:53:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:27,726 INFO L225 Difference]: With dead ends: 555 [2018-12-04 11:53:27,726 INFO L226 Difference]: Without dead ends: 264 [2018-12-04 11:53:27,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 11:53:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-04 11:53:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-12-04 11:53:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-04 11:53:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2018-12-04 11:53:27,797 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2018-12-04 11:53:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:27,797 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2018-12-04 11:53:27,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-04 11:53:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2018-12-04 11:53:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-04 11:53:27,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:27,798 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2018-12-04 11:53:27,798 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:27,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2018-12-04 11:53:27,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:27,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:53:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:27,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:31,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:31,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:31,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:31,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:53:31,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:31,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:53:31,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:53:31,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:53:31,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-04 11:53:31,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:53:31,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:39,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:46,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:46,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2018-12-04 11:53:46,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:46,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-04 11:53:46,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-04 11:53:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 11:53:46,614 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2018-12-04 11:54:16,904 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-04 11:54:17,631 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-04 11:54:18,359 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-04 11:54:19,010 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-12-04 11:54:19,679 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-04 11:54:20,305 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-04 11:54:20,908 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 11:54:21,495 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 11:54:22,101 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 11:54:22,665 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 11:54:23,225 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:54:23,764 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:54:24,295 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:54:24,798 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:54:25,298 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:54:25,767 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:54:26,220 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:54:26,676 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:54:27,106 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:54:27,512 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:54:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:31,718 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2018-12-04 11:54:31,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2018-12-04 11:54:31,718 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2018-12-04 11:54:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:31,720 INFO L225 Difference]: With dead ends: 705 [2018-12-04 11:54:31,720 INFO L226 Difference]: Without dead ends: 410 [2018-12-04 11:54:31,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2018-12-04 11:54:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-04 11:54:31,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2018-12-04 11:54:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-04 11:54:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2018-12-04 11:54:31,805 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2018-12-04 11:54:31,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:31,805 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2018-12-04 11:54:31,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-04 11:54:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2018-12-04 11:54:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-04 11:54:31,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:31,806 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2018-12-04 11:54:31,807 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:31,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:31,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2018-12-04 11:54:31,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:31,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:31,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:54:31,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:31,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:35,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:35,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:54:35,044 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:54:35,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:54:35,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:35,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:54:35,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:54:35,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:54:35,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:54:35,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:54:35,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:38,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:38,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:38,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2018-12-04 11:54:38,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:38,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-04 11:54:38,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-04 11:54:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2018-12-04 11:54:38,902 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2018-12-04 11:54:54,608 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-12-04 11:54:55,234 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-12-04 11:54:55,854 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-04 11:54:56,295 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-04 11:54:56,732 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-12-04 11:54:57,160 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-04 11:54:57,574 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-04 11:54:57,974 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 11:54:58,376 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 11:54:58,775 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 11:54:59,145 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 11:54:59,506 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 11:54:59,874 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 11:55:00,228 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 11:55:00,569 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 11:55:00,899 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 11:55:01,223 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 11:55:01,546 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 11:55:01,852 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 11:55:02,145 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 11:55:02,426 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 11:55:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:55:05,589 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2018-12-04 11:55:05,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-12-04 11:55:05,589 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2018-12-04 11:55:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:55:05,591 INFO L225 Difference]: With dead ends: 574 [2018-12-04 11:55:05,591 INFO L226 Difference]: Without dead ends: 424 [2018-12-04 11:55:05,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2018-12-04 11:55:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-04 11:55:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2018-12-04 11:55:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-04 11:55:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2018-12-04 11:55:05,679 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2018-12-04 11:55:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:55:05,679 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2018-12-04 11:55:05,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-04 11:55:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2018-12-04 11:55:05,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-04 11:55:05,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:55:05,680 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2018-12-04 11:55:05,680 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:55:05,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:55:05,681 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2018-12-04 11:55:05,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:55:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:05,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:55:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:05,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:55:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:07,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:07,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:55:07,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:55:07,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:55:07,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:07,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:55:07,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:55:07,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:55:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:07,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:55:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:10,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:55:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:11,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:55:11,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2018-12-04 11:55:11,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:55:11,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-04 11:55:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-04 11:55:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2018-12-04 11:55:11,826 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2018-12-04 11:55:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:55:15,089 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2018-12-04 11:55:15,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-04 11:55:15,089 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2018-12-04 11:55:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:55:15,091 INFO L225 Difference]: With dead ends: 585 [2018-12-04 11:55:15,091 INFO L226 Difference]: Without dead ends: 278 [2018-12-04 11:55:15,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 11:55:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-04 11:55:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-12-04 11:55:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-04 11:55:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2018-12-04 11:55:15,177 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2018-12-04 11:55:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:55:15,177 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2018-12-04 11:55:15,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-04 11:55:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2018-12-04 11:55:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-04 11:55:15,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:55:15,192 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2018-12-04 11:55:15,192 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:55:15,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:55:15,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2018-12-04 11:55:15,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:55:15,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:15,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:55:15,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:15,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:55:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:18,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:18,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:55:18,535 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:55:18,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:55:18,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:18,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:55:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:55:18,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:55:18,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-04 11:55:18,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:55:18,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:55:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:27,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:55:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2850 proven. 2338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:35,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:55:35,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 203 [2018-12-04 11:55:35,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:55:35,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-12-04 11:55:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-12-04 11:55:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=37018, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 11:55:35,755 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states.