java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:57:02,911 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:57:02,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:57:02,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:57:02,926 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:57:02,927 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:57:02,928 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:57:02,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:57:02,932 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:57:02,933 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:57:02,934 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:57:02,934 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:57:02,935 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:57:02,936 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:57:02,937 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:57:02,938 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:57:02,939 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:57:02,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:57:02,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:57:02,945 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:57:02,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:57:02,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:57:02,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:57:02,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:57:02,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:57:02,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:57:02,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:57:02,954 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:57:02,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:57:02,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:57:02,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:57:02,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:57:02,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:57:02,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:57:02,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:57:02,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:57:02,963 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-04 11:57:02,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:57:02,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:57:02,978 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:57:02,978 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:57:02,978 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:57:02,979 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:57:02,979 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:57:02,979 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:57:02,979 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:57:02,980 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-04 11:57:02,980 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-04 11:57:02,980 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:57:02,980 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:57:02,980 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:57:02,981 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:57:02,981 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:57:02,981 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:57:02,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:57:02,982 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:57:02,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:57:02,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:57:02,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:57:02,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:57:02,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:57:02,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:57:02,983 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:57:02,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:57:02,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:57:02,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:57:02,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:57:02,984 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:57:02,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:57:02,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:57:02,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:57:02,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:57:02,985 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:57:02,985 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:57:02,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:57:02,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:57:02,986 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:57:03,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:57:03,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:57:03,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:57:03,052 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:57:03,052 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:57:03,053 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2018-12-04 11:57:03,054 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2018-12-04 11:57:03,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:57:03,093 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:57:03,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:03,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:57:03,095 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:57:03,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:03,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:57:03,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:57:03,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:57:03,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/1) ... [2018-12-04 11:57:03,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:57:03,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:57:03,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:57:03,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:57:03,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (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:57:03,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:57:03,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:57:03,406 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:57:03,407 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-04 11:57:03,407 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:03 BoogieIcfgContainer [2018-12-04 11:57:03,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:57:03,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:57:03,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:57:03,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:57:03,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:03" (1/2) ... [2018-12-04 11:57:03,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a659414 and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:57:03, skipping insertion in model container [2018-12-04 11:57:03,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:03" (2/2) ... [2018-12-04 11:57:03,415 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2018-12-04 11:57:03,426 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:57:03,434 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:57:03,450 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:57:03,482 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:57:03,482 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:57:03,483 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:57:03,483 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:57:03,483 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:57:03,483 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:57:03,483 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:57:03,484 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:57:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-04 11:57:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:57:03,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:57:03,507 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-04 11:57:03,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:03,658 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:57:03,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:57:03,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:57:03,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:57:03,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:57:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:57:03,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:57:03,680 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-04 11:57:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:03,759 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-04 11:57:03,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:57:03,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:57:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:03,774 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:57:03,775 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:57:03,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:57:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:57:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:57:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:57:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-04 11:57:03,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-04 11:57:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:03,814 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-04 11:57:03,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:57:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-04 11:57:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:57:03,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-04 11:57:03,816 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-04 11:57:03,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:57:03,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:03,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:03,930 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-04 11:57:03,933 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-04 11:57:04,028 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 11:57:04,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:57:29,856 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:57:29,858 INFO L272 AbstractInterpreter]: Visited 6 different actions 50 times. Merged at 4 different actions 28 times. Widened at 2 different actions 12 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-04 11:57:29,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:29,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:57:29,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:29,898 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:57:29,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:29,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:29,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:57:29,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:57:30,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:30,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-04 11:57:30,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:30,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:57:30,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:57:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:57:30,039 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-04 11:57:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:30,069 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-04 11:57:30,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:57:30,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-04 11:57:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:30,070 INFO L225 Difference]: With dead ends: 13 [2018-12-04 11:57:30,070 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:57:30,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:57:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:57:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-04 11:57:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:57:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-04 11:57:30,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-04 11:57:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:30,267 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-04 11:57:30,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:57:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-04 11:57:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:57:30,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:30,269 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-04 11:57:30,271 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:30,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:30,279 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2018-12-04 11:57:30,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:30,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:30,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:57:30,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:30,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:30,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:30,367 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:57:30,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:30,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:30,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:30,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:30,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:57:30,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:30,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:57:30,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:57:30,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:30,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-04 11:57:30,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:30,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:57:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:57:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:57:30,476 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-04 11:57:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:30,514 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-04 11:57:30,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:57:30,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-04 11:57:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:30,516 INFO L225 Difference]: With dead ends: 16 [2018-12-04 11:57:30,516 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:57:30,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:57:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:57:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:57:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:57:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-04 11:57:30,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-04 11:57:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:30,520 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-04 11:57:30,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:57:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-04 11:57:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:57:30,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:30,521 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-04 11:57:30,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:30,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:30,521 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2018-12-04 11:57:30,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:30,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:30,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:57:30,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:30,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:30,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:30,587 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:57:30,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:30,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:30,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:30,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:30,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:30,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:30,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:57:30,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:57:30,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:30,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-04 11:57:30,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:30,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-04 11:57:30,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-04 11:57:30,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:57:30,686 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-04 11:57:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:30,736 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-04 11:57:30,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:57:30,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-04 11:57:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:30,737 INFO L225 Difference]: With dead ends: 19 [2018-12-04 11:57:30,738 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:57:30,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:57:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:57:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-04 11:57:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-04 11:57:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-04 11:57:30,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-04 11:57:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:30,743 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-04 11:57:30,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-04 11:57:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-04 11:57:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-04 11:57:30,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:30,744 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-04 11:57:30,744 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:30,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:30,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2018-12-04 11:57:30,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:30,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:30,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:57:30,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:30,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:30,817 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:30,817 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:57:30,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:30,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:30,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:30,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:30,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:57:30,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:57:31,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:31,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-04 11:57:31,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:31,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:57:31,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:57:31,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:57:31,102 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-04 11:57:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:31,133 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-04 11:57:31,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:57:31,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-04 11:57:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:31,134 INFO L225 Difference]: With dead ends: 22 [2018-12-04 11:57:31,135 INFO L226 Difference]: Without dead ends: 15 [2018-12-04 11:57:31,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:57:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-04 11:57:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-04 11:57:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-04 11:57:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-04 11:57:31,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-04 11:57:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:31,139 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-04 11:57:31,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:57:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-04 11:57:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-04 11:57:31,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:31,140 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-04 11:57:31,140 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:31,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2018-12-04 11:57:31,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:31,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:31,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:31,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:31,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:57:31,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:31,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:31,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:31,738 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:57:31,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:31,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 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:57:31,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:31,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:31,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:57:31,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:31,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:57:31,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:57:32,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:32,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-04 11:57:32,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:32,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 11:57:32,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 11:57:32,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:57:32,096 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-04 11:57:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:32,131 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-04 11:57:32,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:57:32,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-04 11:57:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:32,132 INFO L225 Difference]: With dead ends: 25 [2018-12-04 11:57:32,132 INFO L226 Difference]: Without dead ends: 17 [2018-12-04 11:57:32,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:57:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-04 11:57:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-04 11:57:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 11:57:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-04 11:57:32,136 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-04 11:57:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:32,136 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-04 11:57:32,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 11:57:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-04 11:57:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 11:57:32,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:32,137 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-04 11:57:32,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:32,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2018-12-04 11:57:32,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:32,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:32,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:32,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:57:32,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:32,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:32,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:32,264 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:57:32,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:32,264 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:57:32,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:32,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:32,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:32,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:32,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:57:32,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:57:32,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:32,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-04 11:57:32,550 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:32,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-04 11:57:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-04 11:57:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:57:32,551 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-04 11:57:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:32,583 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-04 11:57:32,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:57:32,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-04 11:57:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:32,585 INFO L225 Difference]: With dead ends: 28 [2018-12-04 11:57:32,585 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:57:32,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:57:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:57:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-04 11:57:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:57:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-04 11:57:32,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-04 11:57:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:32,591 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-04 11:57:32,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-04 11:57:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-04 11:57:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-04 11:57:32,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:32,592 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-04 11:57:32,592 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:32,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2018-12-04 11:57:32,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:32,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:32,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:32,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:32,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:57:32,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:32,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:32,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:32,736 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:57:32,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:32,737 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:57:32,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:32,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:32,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:57:32,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:57:32,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:32,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-04 11:57:32,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:32,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:57:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:57:32,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:57:32,900 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-04 11:57:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:32,939 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-04 11:57:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:57:32,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-04 11:57:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:32,941 INFO L225 Difference]: With dead ends: 31 [2018-12-04 11:57:32,941 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:57:32,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:57:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:57:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-04 11:57:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:57:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-04 11:57:32,945 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-04 11:57:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:32,945 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-04 11:57:32,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:57:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-04 11:57:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:57:32,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:32,946 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-04 11:57:32,946 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:32,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2018-12-04 11:57:32,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:32,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:32,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:32,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:32,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:57:33,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:33,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:33,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:33,063 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:57:33,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:33,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:33,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:33,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:33,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-04 11:57:33,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:33,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:57:33,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:57:33,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:33,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-04 11:57:33,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:33,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:57:33,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:57:33,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:57:33,297 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-04 11:57:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:33,434 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-04 11:57:33,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:57:33,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-04 11:57:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:33,435 INFO L225 Difference]: With dead ends: 34 [2018-12-04 11:57:33,435 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:57:33,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:57:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:57:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-04 11:57:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-04 11:57:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-04 11:57:33,440 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-04 11:57:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:33,440 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-04 11:57:33,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:57:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-04 11:57:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-04 11:57:33,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:33,441 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-04 11:57:33,441 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:33,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:33,442 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2018-12-04 11:57:33,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:33,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:33,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:33,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:33,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:57:33,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:33,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:33,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:33,604 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:57:33,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:33,604 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:57:33,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:33,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:33,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:33,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:33,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:57:33,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:57:33,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:33,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-04 11:57:33,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:33,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-04 11:57:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-04 11:57:33,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:57:33,895 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-04 11:57:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:33,960 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-04 11:57:33,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 11:57:33,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-04 11:57:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:33,961 INFO L225 Difference]: With dead ends: 37 [2018-12-04 11:57:33,961 INFO L226 Difference]: Without dead ends: 25 [2018-12-04 11:57:33,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:57:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-04 11:57:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-04 11:57:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-04 11:57:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-04 11:57:33,966 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-04 11:57:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:33,967 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-04 11:57:33,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-04 11:57:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-04 11:57:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-04 11:57:33,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:33,968 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-04 11:57:33,968 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:33,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2018-12-04 11:57:33,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:33,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:33,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:33,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:33,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:57:34,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:34,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:34,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:34,133 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:57:34,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:34,133 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:57:34,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:34,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:34,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:57:34,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:57:34,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:34,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-04 11:57:34,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:34,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-04 11:57:34,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-04 11:57:34,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:57:34,424 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-04 11:57:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:34,481 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-04 11:57:34,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-04 11:57:34,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-04 11:57:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:34,484 INFO L225 Difference]: With dead ends: 40 [2018-12-04 11:57:34,484 INFO L226 Difference]: Without dead ends: 27 [2018-12-04 11:57:34,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:57:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-04 11:57:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-04 11:57:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-04 11:57:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-04 11:57:34,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-04 11:57:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:34,489 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-04 11:57:34,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-04 11:57:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-04 11:57:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-04 11:57:34,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:34,490 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-04 11:57:34,490 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:34,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:34,490 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2018-12-04 11:57:34,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:34,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:34,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:57:34,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:34,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:34,656 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57: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:57:34,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:34,656 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:57:34,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:34,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:34,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-04 11:57:34,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:34,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:34,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-04 11:57:34,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:34,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:34,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-04 11:57:35,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2018-12-04 11:57:35,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-12-04 11:57:35,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:35,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2018-12-04 11:57:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:57:35,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:57:35,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:35,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2018-12-04 11:57:35,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:35,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-04 11:57:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-04 11:57:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:57:35,898 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2018-12-04 11:57:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:37,274 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-04 11:57:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:57:37,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2018-12-04 11:57:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:37,276 INFO L225 Difference]: With dead ends: 43 [2018-12-04 11:57:37,276 INFO L226 Difference]: Without dead ends: 29 [2018-12-04 11:57:37,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2018-12-04 11:57:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-04 11:57:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-04 11:57:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-04 11:57:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-04 11:57:37,282 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-04 11:57:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:37,282 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-04 11:57:37,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-04 11:57:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-04 11:57:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-04 11:57:37,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:37,283 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-04 11:57:37,284 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:37,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2018-12-04 11:57:37,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:37,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:37,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:57:37,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:37,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:37,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:37,599 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:57:37,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:37,600 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:57:37,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:37,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:37,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:37,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:37,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:57:37,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:57:37,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:37,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-04 11:57:37,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:37,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-04 11:57:37,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-04 11:57:37,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:57:37,929 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-04 11:57:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:37,999 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-04 11:57:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:57:37,999 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-04 11:57:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:38,000 INFO L225 Difference]: With dead ends: 46 [2018-12-04 11:57:38,000 INFO L226 Difference]: Without dead ends: 31 [2018-12-04 11:57:38,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:57:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-04 11:57:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-04 11:57:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 11:57:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-04 11:57:38,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-04 11:57:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:38,007 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-04 11:57:38,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-04 11:57:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-04 11:57:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 11:57:38,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:38,008 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-04 11:57:38,008 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:38,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2018-12-04 11:57:38,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:38,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:38,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:57:38,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:38,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:38,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:38,200 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:57:38,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:38,201 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:57:38,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:38,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:38,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:57:38,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:57:38,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:38,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-04 11:57:38,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:38,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-04 11:57:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-04 11:57:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:57:38,602 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-04 11:57:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:38,702 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-04 11:57:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 11:57:38,702 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-04 11:57:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:38,703 INFO L225 Difference]: With dead ends: 49 [2018-12-04 11:57:38,704 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:57:38,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:57:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:57:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-04 11:57:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-04 11:57:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-04 11:57:38,711 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-04 11:57:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:38,711 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-04 11:57:38,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-04 11:57:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-04 11:57:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-04 11:57:38,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:38,713 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-04 11:57:38,713 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:38,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2018-12-04 11:57:38,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:38,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:38,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:57:39,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:39,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:39,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:39,172 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:57:39,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:39,172 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:57:39,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:39,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:39,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 11:57:39,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:39,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:57:39,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:57:39,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:39,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2018-12-04 11:57:39,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:39,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:57:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:57:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:57:39,716 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-04 11:57:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:39,778 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-04 11:57:39,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-04 11:57:39,780 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-04 11:57:39,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:39,780 INFO L225 Difference]: With dead ends: 52 [2018-12-04 11:57:39,780 INFO L226 Difference]: Without dead ends: 35 [2018-12-04 11:57:39,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:57:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-04 11:57:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-04 11:57:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 11:57:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-04 11:57:39,786 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-04 11:57:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:39,787 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-04 11:57:39,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:57:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-04 11:57:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 11:57:39,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:39,788 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-04 11:57:39,788 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:39,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2018-12-04 11:57:39,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:39,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:39,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:39,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:57:40,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:40,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:40,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:40,039 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:57:40,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:40,039 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:57:40,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:40,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:40,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:40,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:40,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:57:40,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:57:41,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:41,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-04 11:57:41,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:41,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-04 11:57:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-04 11:57:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:57:41,208 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-04 11:57:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:41,280 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-04 11:57:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 11:57:41,280 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-04 11:57:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:41,281 INFO L225 Difference]: With dead ends: 55 [2018-12-04 11:57:41,281 INFO L226 Difference]: Without dead ends: 37 [2018-12-04 11:57:41,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:57:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-04 11:57:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-04 11:57:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-04 11:57:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-04 11:57:41,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-04 11:57:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:41,289 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-04 11:57:41,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-04 11:57:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-04 11:57:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-04 11:57:41,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:41,290 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-04 11:57:41,290 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:41,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2018-12-04 11:57:41,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:41,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:41,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:57:41,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:41,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:41,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:41,518 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:57:41,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:41,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:41,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:41,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:41,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:57:41,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:57:42,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:42,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-04 11:57:42,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:42,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-04 11:57:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-04 11:57:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:57:42,343 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-04 11:57:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:42,435 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-04 11:57:42,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:57:42,435 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-04 11:57:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:42,435 INFO L225 Difference]: With dead ends: 58 [2018-12-04 11:57:42,436 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:57:42,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:57:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:57:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-04 11:57:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-04 11:57:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-04 11:57:42,441 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-04 11:57:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:42,442 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-04 11:57:42,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-04 11:57:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-04 11:57:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-04 11:57:42,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:42,443 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-04 11:57:42,443 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:42,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:42,443 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2018-12-04 11:57:42,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:42,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:42,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:57:43,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:43,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:43,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:43,589 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:57:43,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:43,590 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:57:43,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:43,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:43,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-04 11:57:43,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:43,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:57:43,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:57:44,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:44,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-04 11:57:44,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:44,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-04 11:57:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-04 11:57:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:57:44,135 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-04 11:57:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:44,212 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-04 11:57:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:57:44,213 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-04 11:57:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:44,214 INFO L225 Difference]: With dead ends: 61 [2018-12-04 11:57:44,214 INFO L226 Difference]: Without dead ends: 41 [2018-12-04 11:57:44,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:57:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-04 11:57:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-04 11:57:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-04 11:57:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-04 11:57:44,220 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-04 11:57:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:44,221 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-04 11:57:44,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-04 11:57:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-04 11:57:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-04 11:57:44,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:44,221 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-04 11:57:44,222 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:44,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2018-12-04 11:57:44,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:44,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:44,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:57:44,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:44,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:44,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:44,633 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:57:44,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:44,633 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:57:44,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:44,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:44,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:44,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:44,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:57:44,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:57:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:45,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-04 11:57:45,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:45,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-04 11:57:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-04 11:57:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:57:45,208 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-04 11:57:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:45,407 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-04 11:57:45,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-04 11:57:45,407 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-04 11:57:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:45,408 INFO L225 Difference]: With dead ends: 64 [2018-12-04 11:57:45,408 INFO L226 Difference]: Without dead ends: 43 [2018-12-04 11:57:45,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:57:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-04 11:57:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-04 11:57:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-04 11:57:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-04 11:57:45,414 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-04 11:57:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:45,415 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-04 11:57:45,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-04 11:57:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-04 11:57:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-04 11:57:45,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:45,416 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-04 11:57:45,416 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:45,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2018-12-04 11:57:45,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:45,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:45,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:57:45,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:45,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:45,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:45,640 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:57:45,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:45,640 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:57:45,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:45,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:45,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:57:45,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:57:46,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:46,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-04 11:57:46,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:46,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-04 11:57:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-04 11:57:46,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:57:46,199 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-04 11:57:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:46,272 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-04 11:57:46,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 11:57:46,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-04 11:57:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:46,273 INFO L225 Difference]: With dead ends: 67 [2018-12-04 11:57:46,274 INFO L226 Difference]: Without dead ends: 45 [2018-12-04 11:57:46,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:57:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-04 11:57:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-04 11:57:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 11:57:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-04 11:57:46,281 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-04 11:57:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:46,281 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-04 11:57:46,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-04 11:57:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-04 11:57:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 11:57:46,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:46,282 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-04 11:57:46,282 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:46,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:46,282 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2018-12-04 11:57:46,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:46,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:46,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:46,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:46,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:57:47,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:47,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:47,328 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:47,328 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:57:47,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:47,329 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:57:47,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:47,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:47,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 11:57:47,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:47,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:57:47,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:57:48,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:48,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-04 11:57:48,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:48,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:57:48,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:57:48,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:57:48,363 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-04 11:57:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:48,477 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-04 11:57:48,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-04 11:57:48,477 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-04 11:57:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:48,478 INFO L225 Difference]: With dead ends: 70 [2018-12-04 11:57:48,479 INFO L226 Difference]: Without dead ends: 47 [2018-12-04 11:57:48,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:57:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-04 11:57:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-04 11:57:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-04 11:57:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-04 11:57:48,486 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-04 11:57:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:48,486 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-04 11:57:48,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:57:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-04 11:57:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-04 11:57:48,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:48,487 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-04 11:57:48,487 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:48,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2018-12-04 11:57:48,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:48,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:48,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:57:48,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:48,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:48,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:48,960 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:57:48,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:48,961 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:57:48,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:48,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:49,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:49,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:49,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:57:49,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:57:49,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:49,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-04 11:57:49,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:49,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-04 11:57:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-04 11:57:49,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:57:49,874 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-04 11:57:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:49,964 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-04 11:57:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:57:49,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-04 11:57:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:49,968 INFO L225 Difference]: With dead ends: 73 [2018-12-04 11:57:49,968 INFO L226 Difference]: Without dead ends: 49 [2018-12-04 11:57:49,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:57:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-04 11:57:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-04 11:57:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 11:57:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-04 11:57:49,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-04 11:57:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:49,975 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-04 11:57:49,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-04 11:57:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-04 11:57:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 11:57:49,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:49,976 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-04 11:57:49,976 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:49,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:49,976 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2018-12-04 11:57:49,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:49,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:49,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:49,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:57:50,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:50,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:50,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:50,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:57:50,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:50,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 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:57:50,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:50,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:50,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:57:50,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:57:52,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:52,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-04 11:57:52,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:52,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-04 11:57:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-04 11:57:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:57:52,023 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-04 11:57:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:52,107 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-04 11:57:52,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-04 11:57:52,108 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-04 11:57:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:52,108 INFO L225 Difference]: With dead ends: 76 [2018-12-04 11:57:52,108 INFO L226 Difference]: Without dead ends: 51 [2018-12-04 11:57:52,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:57:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-04 11:57:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-04 11:57:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-04 11:57:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-04 11:57:52,115 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-04 11:57:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:52,115 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-04 11:57:52,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-04 11:57:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-04 11:57:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-04 11:57:52,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:52,116 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-04 11:57:52,117 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:52,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:52,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2018-12-04 11:57:52,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:52,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:52,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:52,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:52,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:57:53,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:53,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:53,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:53,013 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:57:53,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:53,013 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:57:53,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:53,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:53,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 11:57:53,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:53,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:57:53,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:57:53,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:53,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2018-12-04 11:57:53,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:53,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 11:57:53,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 11:57:53,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:57:53,896 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-04 11:57:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:53,986 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-04 11:57:53,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:57:53,987 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-04 11:57:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:53,987 INFO L225 Difference]: With dead ends: 79 [2018-12-04 11:57:53,987 INFO L226 Difference]: Without dead ends: 53 [2018-12-04 11:57:53,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:57:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-04 11:57:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-04 11:57:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-04 11:57:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-04 11:57:53,992 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-04 11:57:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:53,993 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-04 11:57:53,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 11:57:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-04 11:57:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-04 11:57:53,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:53,994 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-04 11:57:53,994 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:53,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:53,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2018-12-04 11:57:53,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:53,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:53,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:53,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:53,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:57:54,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:54,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:54,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:54,501 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:57:54,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:54,501 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:57:54,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:54,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:54,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:54,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:54,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:57:54,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:57:55,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:55,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-04 11:57:55,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:55,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:57:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:57:55,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:57:55,293 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-04 11:57:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:55,424 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-04 11:57:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:57:55,425 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-04 11:57:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:55,425 INFO L225 Difference]: With dead ends: 82 [2018-12-04 11:57:55,426 INFO L226 Difference]: Without dead ends: 55 [2018-12-04 11:57:55,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:57:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-04 11:57:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-04 11:57:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-04 11:57:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-04 11:57:55,431 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-04 11:57:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:55,431 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-04 11:57:55,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:57:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-04 11:57:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-04 11:57:55,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:55,432 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-04 11:57:55,432 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:55,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2018-12-04 11:57:55,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:55,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:55,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:57:55,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:55,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:55,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:55,865 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:57:55,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:55,865 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:57:55,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:55,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:55,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:57:55,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:57:56,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:56,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-04 11:57:56,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:56,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-04 11:57:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-04 11:57:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:57:56,705 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-04 11:57:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:56,796 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-04 11:57:56,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-04 11:57:56,796 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-04 11:57:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:56,797 INFO L225 Difference]: With dead ends: 85 [2018-12-04 11:57:56,797 INFO L226 Difference]: Without dead ends: 57 [2018-12-04 11:57:56,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:57:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-04 11:57:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-04 11:57:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-04 11:57:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-04 11:57:56,803 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-04 11:57:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:56,804 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-04 11:57:56,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-04 11:57:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-04 11:57:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-04 11:57:56,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:56,804 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-04 11:57:56,805 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:56,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2018-12-04 11:57:56,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:56,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:56,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:56,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:56,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:57:57,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:57,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:57,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:57,478 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:57:57,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:57,478 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:57:57,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:57,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:57,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-04 11:57:57,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:57,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:57:57,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:57:58,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:58,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2018-12-04 11:57:58,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:58,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:57:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:57:58,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:57:58,799 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-04 11:57:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:58,873 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-04 11:57:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-04 11:57:58,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-04 11:57:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:58,875 INFO L225 Difference]: With dead ends: 88 [2018-12-04 11:57:58,875 INFO L226 Difference]: Without dead ends: 59 [2018-12-04 11:57:58,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:57:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-04 11:57:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-04 11:57:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 11:57:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-04 11:57:58,880 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-04 11:57:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:58,881 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-04 11:57:58,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:57:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-04 11:57:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 11:57:58,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:58,882 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-04 11:57:58,882 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:58,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2018-12-04 11:57:58,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:58,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:58,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:57:59,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:59,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:59,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:59,521 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:57:59,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:59,521 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:57:59,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:59,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:59,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:59,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:59,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:57:59,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:58:00,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:00,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-04 11:58:00,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:00,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-04 11:58:00,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-04 11:58:00,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:58:00,571 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-04 11:58:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:00,701 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-12-04 11:58:00,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 11:58:00,702 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-04 11:58:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:00,703 INFO L225 Difference]: With dead ends: 91 [2018-12-04 11:58:00,703 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:58:00,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:58:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:58:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-04 11:58:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-04 11:58:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-04 11:58:00,708 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-04 11:58:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:00,709 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-04 11:58:00,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-04 11:58:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-04 11:58:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-04 11:58:00,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:00,710 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-04 11:58:00,710 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:00,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:00,710 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2018-12-04 11:58:00,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:00,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:00,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:00,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:00,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:58:01,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:01,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:01,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:01,207 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:58:01,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:01,208 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:58:01,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:01,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:01,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:58:01,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:58:02,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:02,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-04 11:58:02,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:02,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-04 11:58:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-04 11:58:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:58:02,487 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-04 11:58:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:02,636 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-04 11:58:02,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:58:02,637 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-04 11:58:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:02,638 INFO L225 Difference]: With dead ends: 94 [2018-12-04 11:58:02,638 INFO L226 Difference]: Without dead ends: 63 [2018-12-04 11:58:02,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:58:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-04 11:58:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-04 11:58:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 11:58:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-04 11:58:02,643 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-04 11:58:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:02,644 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-04 11:58:02,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-04 11:58:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-04 11:58:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 11:58:02,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:02,645 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-04 11:58:02,645 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:02,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2018-12-04 11:58:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:02,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:02,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:58:03,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:03,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:03,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:03,848 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:58:03,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:03,848 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:58:03,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:03,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:04,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 11:58:04,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:04,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:58:04,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:58:05,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:05,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2018-12-04 11:58:05,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:05,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 11:58:05,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 11:58:05,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:58:05,298 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-04 11:58:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:05,373 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-04 11:58:05,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:58:05,374 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-04 11:58:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:05,375 INFO L225 Difference]: With dead ends: 97 [2018-12-04 11:58:05,375 INFO L226 Difference]: Without dead ends: 65 [2018-12-04 11:58:05,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:58:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-04 11:58:05,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-04 11:58:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-04 11:58:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-04 11:58:05,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-12-04 11:58:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:05,380 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-04 11:58:05,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 11:58:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-04 11:58:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-04 11:58:05,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:05,380 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-04 11:58:05,381 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:05,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2018-12-04 11:58:05,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:05,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:05,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:05,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:05,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:58:05,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:05,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:05,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:05,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:58:05,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:05,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 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:58:05,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:05,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:05,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:05,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:05,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:58:05,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:58:07,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:07,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-04 11:58:07,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:07,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-04 11:58:07,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-04 11:58:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:58:07,030 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-04 11:58:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:07,147 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-04 11:58:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-04 11:58:07,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-04 11:58:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:07,149 INFO L225 Difference]: With dead ends: 100 [2018-12-04 11:58:07,149 INFO L226 Difference]: Without dead ends: 67 [2018-12-04 11:58:07,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:58:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-04 11:58:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-04 11:58:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-04 11:58:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-04 11:58:07,154 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-04 11:58:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:07,154 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-04 11:58:07,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-04 11:58:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-04 11:58:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-04 11:58:07,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:07,155 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-04 11:58:07,155 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:07,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2018-12-04 11:58:07,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:07,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:07,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:07,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:07,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:58:07,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:07,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:07,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:07,647 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:58:07,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:07,647 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:58:07,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:07,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:07,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:58:07,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:58:09,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:09,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-04 11:58:09,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:09,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-04 11:58:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-04 11:58:09,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:58:09,274 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-04 11:58:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:09,407 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-12-04 11:58:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 11:58:09,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-04 11:58:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:09,409 INFO L225 Difference]: With dead ends: 103 [2018-12-04 11:58:09,409 INFO L226 Difference]: Without dead ends: 69 [2018-12-04 11:58:09,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:58:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-04 11:58:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-04 11:58:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-04 11:58:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-04 11:58:09,413 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-04 11:58:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:09,413 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-04 11:58:09,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-04 11:58:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-04 11:58:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-04 11:58:09,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:09,414 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-04 11:58:09,414 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:09,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2018-12-04 11:58:09,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:09,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:09,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:09,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:58:10,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:10,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:10,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:10,171 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:58:10,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:10,171 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:58:10,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:10,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:10,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-04 11:58:10,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:10,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:58:10,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:58:12,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:12,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-04 11:58:12,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:12,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:58:12,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:58:12,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:58:12,015 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-04 11:58:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:12,163 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-04 11:58:12,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:58:12,163 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-04 11:58:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:12,164 INFO L225 Difference]: With dead ends: 106 [2018-12-04 11:58:12,164 INFO L226 Difference]: Without dead ends: 71 [2018-12-04 11:58:12,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:58:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-04 11:58:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-04 11:58:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-04 11:58:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-04 11:58:12,170 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-04 11:58:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:12,170 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-04 11:58:12,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:58:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-04 11:58:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-04 11:58:12,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:12,171 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-04 11:58:12,171 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:12,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2018-12-04 11:58:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:12,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:12,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:58:12,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:12,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:12,870 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:12,870 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:58:12,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:12,870 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:58:12,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:12,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:12,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:12,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:12,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:58:12,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:58:14,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:14,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-04 11:58:14,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:14,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-04 11:58:14,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-04 11:58:14,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:58:14,483 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-04 11:58:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:14,651 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-12-04 11:58:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 11:58:14,652 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-04 11:58:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:14,653 INFO L225 Difference]: With dead ends: 109 [2018-12-04 11:58:14,653 INFO L226 Difference]: Without dead ends: 73 [2018-12-04 11:58:14,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:58:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-04 11:58:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-04 11:58:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 11:58:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-04 11:58:14,657 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-12-04 11:58:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:14,658 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-04 11:58:14,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-04 11:58:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-04 11:58:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 11:58:14,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:14,659 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-04 11:58:14,659 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:14,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2018-12-04 11:58:14,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:14,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:14,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:58:15,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:15,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:15,391 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:15,391 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:58:15,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:15,391 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:58:15,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:15,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:15,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:58:15,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:58:16,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:16,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-04 11:58:16,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:16,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-04 11:58:16,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-04 11:58:16,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:58:16,840 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-04 11:58:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:16,989 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-04 11:58:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:58:16,990 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-04 11:58:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:16,990 INFO L225 Difference]: With dead ends: 112 [2018-12-04 11:58:16,991 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 11:58:16,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:58:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 11:58:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-04 11:58:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-04 11:58:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-04 11:58:16,996 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-04 11:58:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:16,996 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-04 11:58:16,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-04 11:58:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-04 11:58:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-04 11:58:16,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:16,997 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-04 11:58:16,997 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:16,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2018-12-04 11:58:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:16,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:16,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:16,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:16,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:58:17,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:17,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:17,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:17,631 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:58:17,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:17,631 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:58:17,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:17,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:18,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-04 11:58:18,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:18,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:58:18,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:58:19,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:19,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-04 11:58:19,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:19,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 11:58:19,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 11:58:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:58:19,839 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-04 11:58:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:19,989 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-04 11:58:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-04 11:58:19,989 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-04 11:58:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:19,989 INFO L225 Difference]: With dead ends: 115 [2018-12-04 11:58:19,989 INFO L226 Difference]: Without dead ends: 77 [2018-12-04 11:58:19,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:58:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-04 11:58:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-04 11:58:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-04 11:58:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-04 11:58:19,993 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-04 11:58:19,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:19,994 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-04 11:58:19,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 11:58:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-04 11:58:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-04 11:58:19,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:19,994 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-04 11:58:19,994 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:19,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:19,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2018-12-04 11:58:19,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:19,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:19,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:58:20,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:20,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:20,716 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:20,716 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:58:20,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:20,716 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:58:20,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:20,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:20,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:20,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:20,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:58:20,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:58:22,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-04 11:58:22,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:22,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-04 11:58:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-04 11:58:22,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:58:22,322 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-04 11:58:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:22,482 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-12-04 11:58:22,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:58:22,482 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-04 11:58:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:22,483 INFO L225 Difference]: With dead ends: 118 [2018-12-04 11:58:22,483 INFO L226 Difference]: Without dead ends: 79 [2018-12-04 11:58:22,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:58:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-04 11:58:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-04 11:58:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-04 11:58:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-04 11:58:22,486 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-04 11:58:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:22,486 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-04 11:58:22,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-04 11:58:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-04 11:58:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-04 11:58:22,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:22,487 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-04 11:58:22,487 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:22,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2018-12-04 11:58:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:22,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:22,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:22,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:58:23,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:23,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:23,125 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:23,125 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:58:23,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:23,125 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:58:23,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:23,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:23,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:58:23,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:58:25,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:25,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-04 11:58:25,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:25,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-04 11:58:25,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-04 11:58:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:58:25,141 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-04 11:58:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:25,274 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-12-04 11:58:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 11:58:25,274 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-04 11:58:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:25,275 INFO L225 Difference]: With dead ends: 121 [2018-12-04 11:58:25,275 INFO L226 Difference]: Without dead ends: 81 [2018-12-04 11:58:25,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:58:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-04 11:58:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-04 11:58:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-04 11:58:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-04 11:58:25,279 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-04 11:58:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:25,279 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-04 11:58:25,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-04 11:58:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-04 11:58:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-04 11:58:25,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:25,279 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-04 11:58:25,280 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:25,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2018-12-04 11:58:25,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:25,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:25,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:25,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:25,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:58:25,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:25,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:25,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:25,996 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:58:25,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:25,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:58:26,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:26,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:26,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 11:58:26,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:26,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:58:26,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:58:28,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:28,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-04 11:58:28,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:28,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:58:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:58:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:58:28,455 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-04 11:58:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:28,673 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-12-04 11:58:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-04 11:58:28,673 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-04 11:58:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:28,674 INFO L225 Difference]: With dead ends: 124 [2018-12-04 11:58:28,674 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 11:58:28,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:58:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 11:58:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-04 11:58:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-04 11:58:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-04 11:58:28,678 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-04 11:58:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:28,679 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-04 11:58:28,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:58:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-04 11:58:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-04 11:58:28,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:28,679 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-04 11:58:28,679 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:28,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2018-12-04 11:58:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:28,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:28,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:58:29,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:29,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:29,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:29,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:58:29,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:29,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 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:58:29,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:29,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:29,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:29,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:29,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:58:29,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:58:31,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:31,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-04 11:58:31,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:31,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-04 11:58:31,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-04 11:58:31,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:58:31,840 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-04 11:58:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:32,005 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-12-04 11:58:32,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-04 11:58:32,006 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-04 11:58:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:32,006 INFO L225 Difference]: With dead ends: 127 [2018-12-04 11:58:32,007 INFO L226 Difference]: Without dead ends: 85 [2018-12-04 11:58:32,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:58:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-04 11:58:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-04 11:58:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-04 11:58:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-04 11:58:32,011 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-04 11:58:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:32,011 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-04 11:58:32,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-04 11:58:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-04 11:58:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-04 11:58:32,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:32,012 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-04 11:58:32,012 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:32,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2018-12-04 11:58:32,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:32,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:32,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:32,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:32,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:58:32,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:32,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:32,917 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:32,917 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:58:32,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:32,917 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:58:32,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:32,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:32,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:58:32,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:58:35,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:35,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-04 11:58:35,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:35,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-04 11:58:35,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-04 11:58:35,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:58:35,240 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-04 11:58:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:35,396 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-04 11:58:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-04 11:58:35,396 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-04 11:58:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:35,397 INFO L225 Difference]: With dead ends: 130 [2018-12-04 11:58:35,397 INFO L226 Difference]: Without dead ends: 87 [2018-12-04 11:58:35,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:58:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-04 11:58:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-04 11:58:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 11:58:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-04 11:58:35,403 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-04 11:58:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:35,403 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-04 11:58:35,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-04 11:58:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-04 11:58:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 11:58:35,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:35,404 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-04 11:58:35,404 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:35,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:35,405 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2018-12-04 11:58:35,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:35,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:35,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:58:36,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:36,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:36,287 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:36,287 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:58:36,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:36,287 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:58:36,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:36,295 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:37,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 11:58:37,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:37,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:58:37,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:58:39,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:39,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-04 11:58:39,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:39,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 11:58:39,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 11:58:39,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:58:39,316 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-04 11:58:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:39,463 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-04 11:58:39,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 11:58:39,464 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-04 11:58:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:39,465 INFO L225 Difference]: With dead ends: 133 [2018-12-04 11:58:39,465 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 11:58:39,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:58:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 11:58:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-04 11:58:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-04 11:58:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-04 11:58:39,470 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-12-04 11:58:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:39,471 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-04 11:58:39,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 11:58:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-04 11:58:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-04 11:58:39,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:39,471 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-04 11:58:39,471 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:39,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2018-12-04 11:58:39,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:39,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:39,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:39,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:58:41,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:41,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:41,514 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:41,514 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:58:41,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:41,514 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:58:41,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:41,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:41,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:41,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:41,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:58:41,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:58:43,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:43,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-04 11:58:43,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:43,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-04 11:58:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-04 11:58:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:58:43,814 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-04 11:58:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:44,085 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-12-04 11:58:44,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-04 11:58:44,086 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-04 11:58:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:44,086 INFO L225 Difference]: With dead ends: 136 [2018-12-04 11:58:44,086 INFO L226 Difference]: Without dead ends: 91 [2018-12-04 11:58:44,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:58:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-04 11:58:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-04 11:58:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-04 11:58:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-04 11:58:44,091 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-04 11:58:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:44,091 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-04 11:58:44,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-04 11:58:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-04 11:58:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-04 11:58:44,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:44,092 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-04 11:58:44,093 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:44,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2018-12-04 11:58:44,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:44,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:44,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:44,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:44,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:58:45,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:45,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:45,262 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:45,262 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:58:45,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:45,262 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:58:45,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:45,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:45,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:58:45,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:58:47,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:47,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-04 11:58:47,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:47,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-04 11:58:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-04 11:58:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:58:47,498 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-04 11:58:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:48,138 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-12-04 11:58:48,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-04 11:58:48,138 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-04 11:58:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:48,139 INFO L225 Difference]: With dead ends: 139 [2018-12-04 11:58:48,139 INFO L226 Difference]: Without dead ends: 93 [2018-12-04 11:58:48,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:58:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-04 11:58:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-04 11:58:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-04 11:58:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-04 11:58:48,142 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-04 11:58:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:48,143 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-04 11:58:48,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-04 11:58:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-04 11:58:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-04 11:58:48,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:48,143 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-04 11:58:48,143 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:48,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2018-12-04 11:58:48,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:48,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:48,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:58:49,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:49,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:49,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:49,829 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:58:49,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:49,830 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:58:49,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:49,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:50,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-04 11:58:50,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:50,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:58:50,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:58:52,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:52,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2018-12-04 11:58:52,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:52,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:58:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:58:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:58:52,963 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-04 11:58:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:54,017 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-12-04 11:58:54,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 11:58:54,017 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-04 11:58:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:54,018 INFO L225 Difference]: With dead ends: 142 [2018-12-04 11:58:54,018 INFO L226 Difference]: Without dead ends: 95 [2018-12-04 11:58:54,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:58:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-04 11:58:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-04 11:58:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-04 11:58:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-04 11:58:54,022 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-04 11:58:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:54,022 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-04 11:58:54,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:58:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-04 11:58:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-04 11:58:54,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:54,023 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-04 11:58:54,023 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:54,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2018-12-04 11:58:54,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:54,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:54,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:58:55,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:55,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:55,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:55,191 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:58:55,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:55,191 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:58:55,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:55,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:55,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:55,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:55,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:58:55,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:58:58,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:58,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-04 11:58:58,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:58,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-04 11:58:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-04 11:58:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:58:58,881 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-04 11:58:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:59,086 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-04 11:58:59,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 11:58:59,087 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-04 11:58:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:59,087 INFO L225 Difference]: With dead ends: 145 [2018-12-04 11:58:59,088 INFO L226 Difference]: Without dead ends: 97 [2018-12-04 11:58:59,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:58:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-04 11:58:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-04 11:58:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-04 11:58:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-04 11:58:59,091 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-12-04 11:58:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:59,091 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-04 11:58:59,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-04 11:58:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-04 11:58:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-04 11:58:59,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:59,092 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-04 11:58:59,092 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:59,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2018-12-04 11:58:59,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:59,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:59,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:59:00,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:00,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:00,238 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:00,239 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:59:00,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:00,239 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:59:00,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:00,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:00,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:59:00,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:59:03,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:03,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-04 11:59:03,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:03,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-04 11:59:03,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-04 11:59:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:59:03,115 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-04 11:59:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:03,436 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-12-04 11:59:03,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-04 11:59:03,437 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-04 11:59:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:03,438 INFO L225 Difference]: With dead ends: 148 [2018-12-04 11:59:03,438 INFO L226 Difference]: Without dead ends: 99 [2018-12-04 11:59:03,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:59:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-04 11:59:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-04 11:59:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-04 11:59:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-04 11:59:03,443 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-04 11:59:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:03,443 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-04 11:59:03,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-04 11:59:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-04 11:59:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-04 11:59:03,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:03,444 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-04 11:59:03,444 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:03,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:03,444 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2018-12-04 11:59:03,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:03,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:03,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:59:04,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:04,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:04,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:04,640 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:59:04,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:04,640 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:59:04,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:04,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:06,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 11:59:06,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:06,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:59:06,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:59:09,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:09,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-04 11:59:09,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:09,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 11:59:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 11:59:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:59:09,179 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-04 11:59:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:09,609 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-12-04 11:59:09,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 11:59:09,610 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-04 11:59:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:09,610 INFO L225 Difference]: With dead ends: 151 [2018-12-04 11:59:09,610 INFO L226 Difference]: Without dead ends: 101 [2018-12-04 11:59:09,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:59:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-04 11:59:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-04 11:59:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 11:59:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-04 11:59:09,615 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-04 11:59:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:09,615 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-04 11:59:09,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 11:59:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-04 11:59:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 11:59:09,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:09,616 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-04 11:59:09,617 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:09,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2018-12-04 11:59:09,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:09,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:09,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:59:11,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:11,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:11,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:11,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:59:11,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:11,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 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:59:11,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:11,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:11,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:11,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:11,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:59:11,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:59:14,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-04 11:59:14,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:14,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-04 11:59:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-04 11:59:14,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:59:14,612 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-04 11:59:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:14,910 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-12-04 11:59:14,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-04 11:59:14,910 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-04 11:59:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:14,911 INFO L225 Difference]: With dead ends: 154 [2018-12-04 11:59:14,912 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 11:59:14,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:59:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 11:59:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-04 11:59:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-04 11:59:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-04 11:59:14,917 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-04 11:59:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:14,917 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-04 11:59:14,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-04 11:59:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-04 11:59:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-04 11:59:14,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:14,918 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-04 11:59:14,918 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:14,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2018-12-04 11:59:14,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:14,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:14,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:14,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:59:16,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:16,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:16,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:16,463 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:59:16,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:16,463 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:59:16,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:16,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:16,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:59:16,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:59:19,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:19,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-04 11:59:19,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:19,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-04 11:59:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-04 11:59:19,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:59:19,366 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-04 11:59:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:19,622 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-12-04 11:59:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 11:59:19,623 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-04 11:59:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:19,624 INFO L225 Difference]: With dead ends: 157 [2018-12-04 11:59:19,624 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 11:59:19,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:59:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 11:59:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-04 11:59:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 11:59:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-04 11:59:19,629 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-04 11:59:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:19,629 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-04 11:59:19,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-04 11:59:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-04 11:59:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 11:59:19,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:19,630 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-04 11:59:19,630 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:19,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2018-12-04 11:59:19,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:19,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:19,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:19,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:59:21,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:21,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:21,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:21,632 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:59:21,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:21,633 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:59:21,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:21,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:22,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-04 11:59:22,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:22,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:59:22,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:59:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:26,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-04 11:59:26,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:59:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:59:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:59:26,307 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-04 11:59:26,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:26,677 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-04 11:59:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-04 11:59:26,677 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-04 11:59:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:26,678 INFO L225 Difference]: With dead ends: 160 [2018-12-04 11:59:26,678 INFO L226 Difference]: Without dead ends: 107 [2018-12-04 11:59:26,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:59:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-04 11:59:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-04 11:59:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-04 11:59:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-04 11:59:26,684 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-04 11:59:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:26,684 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-04 11:59:26,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:59:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-04 11:59:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-04 11:59:26,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:26,685 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-04 11:59:26,685 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:26,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2018-12-04 11:59:26,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:26,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:26,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:26,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:26,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:59:28,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:28,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:28,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:28,278 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:59:28,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:28,278 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:59:28,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:28,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:28,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:28,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:28,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:59:28,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:59:31,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:31,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-04 11:59:31,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:31,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-04 11:59:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-04 11:59:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:59:31,761 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-04 11:59:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:32,070 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-12-04 11:59:32,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 11:59:32,071 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-04 11:59:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:32,071 INFO L225 Difference]: With dead ends: 163 [2018-12-04 11:59:32,072 INFO L226 Difference]: Without dead ends: 109 [2018-12-04 11:59:32,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:59:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-04 11:59:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-04 11:59:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-04 11:59:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-04 11:59:32,077 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-04 11:59:32,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:32,077 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-04 11:59:32,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-04 11:59:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-04 11:59:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-04 11:59:32,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:32,078 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-04 11:59:32,079 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:32,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2018-12-04 11:59:32,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:32,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:32,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:32,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:32,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:59:33,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:33,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:33,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:33,591 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:59:33,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:33,591 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:59:33,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:33,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:33,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:59:33,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:59:37,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:37,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-04 11:59:37,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:37,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:59:37,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:59:37,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:59:37,035 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-04 11:59:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:37,359 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-12-04 11:59:37,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 11:59:37,360 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-04 11:59:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:37,360 INFO L225 Difference]: With dead ends: 166 [2018-12-04 11:59:37,360 INFO L226 Difference]: Without dead ends: 111 [2018-12-04 11:59:37,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:59:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-04 11:59:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-04 11:59:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-04 11:59:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-04 11:59:37,364 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-04 11:59:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:37,364 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-04 11:59:37,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:59:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-04 11:59:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-04 11:59:37,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:37,365 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-04 11:59:37,365 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:37,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2018-12-04 11:59:37,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:37,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:37,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:37,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:37,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-04 11:59:38,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:38,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:38,700 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:38,700 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:59:38,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:38,700 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:59:38,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:38,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:40,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-04 11:59:40,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:40,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:40,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-04 11:59:40,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:40,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:40,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-04 12:00:13,685 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-04 12:00:13,886 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:13,888 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-12-04 12:00:13,892 INFO L168 Benchmark]: Toolchain (without parser) took 190800.53 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 578.0 MB. Max. memory is 7.1 GB. [2018-12-04 12:00:13,894 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 12:00:13,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 12:00:13,895 INFO L168 Benchmark]: Boogie Preprocessor took 22.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 12:00:13,895 INFO L168 Benchmark]: RCFGBuilder took 250.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-04 12:00:13,896 INFO L168 Benchmark]: TraceAbstraction took 190483.66 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 556.8 MB. Max. memory is 7.1 GB. [2018-12-04 12:00:13,899 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 250.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190483.66 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 556.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...