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/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:27:27,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:27:27,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:27:27,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:27:27,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:27:27,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:27:27,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:27:27,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:27:27,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:27:27,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:27:27,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:27:27,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:27:27,203 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:27:27,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:27:27,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:27:27,208 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:27:27,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:27:27,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:27:27,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:27:27,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:27:27,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:27:27,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:27:27,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:27:27,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:27:27,219 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:27:27,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:27:27,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:27:27,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:27:27,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:27:27,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:27:27,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:27:27,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:27:27,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:27:27,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:27:27,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:27:27,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:27:27,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-11 11:27:27,240 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:27:27,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:27:27,241 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:27:27,242 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:27:27,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:27:27,242 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:27:27,242 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:27:27,242 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:27:27,243 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:27:27,243 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 11:27:27,243 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 11:27:27,243 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:27:27,243 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:27:27,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:27:27,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:27:27,245 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:27:27,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:27:27,245 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:27:27,245 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:27:27,245 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:27:27,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:27:27,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:27:27,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:27:27,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:27:27,246 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:27:27,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:27:27,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:27:27,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:27:27,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:27:27,247 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:27:27,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:27:27,248 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:27:27,248 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:27:27,248 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:27:27,248 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:27:27,249 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:27:27,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:27:27,249 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:27:27,249 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:27:27,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:27:27,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:27:27,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:27:27,305 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:27:27,306 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:27:27,307 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-01-11 11:27:27,307 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-01-11 11:27:27,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:27:27,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:27:27,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:27:27,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:27:27,345 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:27:27,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:27:27,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:27:27,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:27:27,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:27:27,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:27:27,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:27:27,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:27:27,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:27:27,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:27:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:27:27,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:27:27,700 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:27:27,701 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-11 11:27:27,702 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:27:27 BoogieIcfgContainer [2019-01-11 11:27:27,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:27:27,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:27:27,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:27:27,707 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:27:27,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/2) ... [2019-01-11 11:27:27,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a8f700 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:27:27, skipping insertion in model container [2019-01-11 11:27:27,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:27:27" (2/2) ... [2019-01-11 11:27:27,711 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-01-11 11:27:27,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:27:27,729 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 11:27:27,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 11:27:27,780 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:27:27,780 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:27:27,781 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:27:27,781 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:27:27,781 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:27:27,781 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:27:27,781 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:27:27,782 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:27:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-11 11:27:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:27:27,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:27,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:27:27,807 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-11 11:27:27,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:27,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:27,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:27,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:27,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:27,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:27:27,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:27:27,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:27:27,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:27:27,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:27:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:27:27,973 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-11 11:27:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:28,027 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-11 11:27:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:27:28,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 11:27:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:28,041 INFO L225 Difference]: With dead ends: 9 [2019-01-11 11:27:28,041 INFO L226 Difference]: Without dead ends: 5 [2019-01-11 11:27:28,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:27:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-11 11:27:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-11 11:27:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-11 11:27:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-11 11:27:28,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-11 11:27:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:28,081 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-11 11:27:28,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:27:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-11 11:27:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:27:28,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:28,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:27:28,082 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-11 11:27:28,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:28,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:28,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:28,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:28,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:28,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:28,246 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:27:28,249 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-11 11:27:28,395 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:27:28,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:27:29,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:27:29,545 INFO L272 AbstractInterpreter]: Visited 4 different actions 20 times. Merged at 1 different actions 8 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:27:29,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:29,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:27:29,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:29,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:29,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:29,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:29,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:29,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:29,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:29,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-11 11:27:29,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:29,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:27:29,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:27:29,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:27:29,746 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-11 11:27:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:29,768 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-11 11:27:29,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:27:29,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:27:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:29,769 INFO L225 Difference]: With dead ends: 8 [2019-01-11 11:27:29,769 INFO L226 Difference]: Without dead ends: 6 [2019-01-11 11:27:29,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:27:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-11 11:27:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-11 11:27:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 11:27:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-11 11:27:29,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-11 11:27:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:29,775 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-11 11:27:29,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:27:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-11 11:27:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:27:29,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:29,776 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 11:27:29,777 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:29,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:29,778 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-11 11:27:29,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:29,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:29,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:29,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:29,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:29,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:29,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:29,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:29,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:29,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:29,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:30,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:27:30,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:30,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:30,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:30,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:30,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-11 11:27:30,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:30,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:27:30,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:27:30,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:27:30,210 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-11 11:27:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:30,250 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-11 11:27:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:27:30,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-11 11:27:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:30,251 INFO L225 Difference]: With dead ends: 9 [2019-01-11 11:27:30,252 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 11:27:30,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:27:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 11:27:30,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 11:27:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 11:27:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-11 11:27:30,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-11 11:27:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:30,257 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-11 11:27:30,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:27:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-11 11:27:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:27:30,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:30,259 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-11 11:27:30,259 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:30,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-11 11:27:30,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:30,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:30,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:30,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:30,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:30,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:30,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:30,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:30,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:30,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:30,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:30,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:30,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:30,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:30,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:30,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:30,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:30,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-11 11:27:30,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:30,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:27:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:27:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:27:30,653 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-11 11:27:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:30,677 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-11 11:27:30,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:27:30,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-11 11:27:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:30,685 INFO L225 Difference]: With dead ends: 10 [2019-01-11 11:27:30,685 INFO L226 Difference]: Without dead ends: 8 [2019-01-11 11:27:30,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:27:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-11 11:27:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-11 11:27:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 11:27:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-11 11:27:30,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-11 11:27:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:30,692 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-11 11:27:30,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:27:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-11 11:27:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:27:30,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:30,693 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-11 11:27:30,693 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:30,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-11 11:27:30,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:30,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:30,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:30,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:30,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:30,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:30,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:30,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:30,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:30,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:30,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:30,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:30,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:30,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:30,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:31,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:31,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-11 11:27:31,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:31,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:27:31,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:27:31,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:27:31,005 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-11 11:27:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:31,030 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-11 11:27:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:27:31,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 11:27:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:31,032 INFO L225 Difference]: With dead ends: 11 [2019-01-11 11:27:31,032 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 11:27:31,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:27:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 11:27:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 11:27:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 11:27:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-11 11:27:31,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-11 11:27:31,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:31,035 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-11 11:27:31,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:27:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-11 11:27:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:27:31,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:31,036 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-11 11:27:31,036 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-11 11:27:31,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:31,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:31,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:31,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:31,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:31,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:31,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:31,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:31,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:31,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:31,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:31,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:31,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:31,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:27:31,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:31,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:31,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:31,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:31,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-11 11:27:31,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:31,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:27:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:27:31,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:27:31,988 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-11 11:27:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:32,021 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-11 11:27:32,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:27:32,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-11 11:27:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:32,023 INFO L225 Difference]: With dead ends: 12 [2019-01-11 11:27:32,023 INFO L226 Difference]: Without dead ends: 10 [2019-01-11 11:27:32,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:27:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-11 11:27:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-11 11:27:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 11:27:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-11 11:27:32,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-11 11:27:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:32,026 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-11 11:27:32,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:27:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-11 11:27:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:27:32,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:32,027 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-11 11:27:32,027 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-11 11:27:32,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:32,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:32,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:32,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:32,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:32,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:32,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:32,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:32,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:32,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:32,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:32,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:32,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:32,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:32,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:32,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:32,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-11 11:27:32,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:32,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:27:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:27:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:27:32,363 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-11 11:27:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:32,385 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-11 11:27:32,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:27:32,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-11 11:27:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:32,387 INFO L225 Difference]: With dead ends: 13 [2019-01-11 11:27:32,388 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 11:27:32,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:27:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 11:27:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 11:27:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:27:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-11 11:27:32,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-11 11:27:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:32,392 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-11 11:27:32,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:27:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-11 11:27:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:27:32,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:32,393 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-11 11:27:32,393 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:32,393 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-11 11:27:32,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:32,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:32,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:32,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:32,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:32,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:32,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:32,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:32,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:32,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:32,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:32,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:32,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:32,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-11 11:27:32,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:32,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:27:32,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:27:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:27:32,858 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-11 11:27:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:32,881 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-11 11:27:32,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:27:32,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-11 11:27:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:32,889 INFO L225 Difference]: With dead ends: 14 [2019-01-11 11:27:32,889 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 11:27:32,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:27:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 11:27:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 11:27:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:27:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-11 11:27:32,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-11 11:27:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:32,893 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-11 11:27:32,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:27:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-11 11:27:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 11:27:32,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:32,893 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-11 11:27:32,894 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-11 11:27:32,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:32,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:32,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:33,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:33,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:33,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:33,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:33,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:33,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:33,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:33,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:33,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-11 11:27:33,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:33,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:33,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:33,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:33,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-11 11:27:33,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:33,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:27:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:27:33,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:27:33,244 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-11 11:27:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:33,267 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-11 11:27:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:27:33,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-11 11:27:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:33,268 INFO L225 Difference]: With dead ends: 15 [2019-01-11 11:27:33,268 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 11:27:33,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:27:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 11:27:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-11 11:27:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 11:27:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-11 11:27:33,271 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-11 11:27:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:33,271 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-11 11:27:33,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:27:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-11 11:27:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 11:27:33,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:33,272 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-11 11:27:33,272 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:33,272 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-11 11:27:33,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:33,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:33,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:33,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:33,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:33,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:33,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:33,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:33,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:33,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:33,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:33,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:33,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:33,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:33,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:33,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:33,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:33,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:33,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-11 11:27:33,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:33,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:27:33,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:27:33,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:27:33,669 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-11 11:27:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:33,695 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-11 11:27:33,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:27:33,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-11 11:27:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:33,697 INFO L225 Difference]: With dead ends: 16 [2019-01-11 11:27:33,697 INFO L226 Difference]: Without dead ends: 14 [2019-01-11 11:27:33,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:27:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-11 11:27:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-11 11:27:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 11:27:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-11 11:27:33,701 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-11 11:27:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:33,701 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-11 11:27:33,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:27:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-11 11:27:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 11:27:33,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:33,702 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-11 11:27:33,702 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-11 11:27:33,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:33,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:33,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:33,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:33,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:33,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:33,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:33,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:33,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:33,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:33,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:33,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:34,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:34,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-11 11:27:34,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:34,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:27:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:27:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:27:34,087 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-11 11:27:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:34,167 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-11 11:27:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:27:34,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-11 11:27:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:34,168 INFO L225 Difference]: With dead ends: 17 [2019-01-11 11:27:34,168 INFO L226 Difference]: Without dead ends: 15 [2019-01-11 11:27:34,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:27:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-11 11:27:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-11 11:27:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 11:27:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-11 11:27:34,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-11 11:27:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:34,173 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-11 11:27:34,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:27:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-11 11:27:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 11:27:34,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:34,173 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-11 11:27:34,174 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-11 11:27:34,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:34,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:34,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:34,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:34,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:34,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:34,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:34,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:34,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:34,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:34,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:34,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:34,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-11 11:27:34,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:34,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:34,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:34,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:34,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-11 11:27:34,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:34,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:27:34,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:27:34,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:27:34,855 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-11 11:27:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:34,894 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-11 11:27:34,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:27:34,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-11 11:27:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:34,895 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:27:34,895 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 11:27:34,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:27:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 11:27:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-11 11:27:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:27:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-11 11:27:34,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-11 11:27:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:34,900 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-11 11:27:34,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:27:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-11 11:27:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 11:27:34,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:34,900 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-11 11:27:34,901 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:34,901 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-11 11:27:34,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:34,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:34,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:35,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:35,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:35,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:35,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:35,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:35,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:35,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:35,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:35,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:35,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:35,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:35,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:35,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:35,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-11 11:27:35,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:35,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 11:27:35,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 11:27:35,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-11 11:27:35,359 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-11 11:27:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:35,421 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-11 11:27:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:27:35,424 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-11 11:27:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:35,425 INFO L225 Difference]: With dead ends: 19 [2019-01-11 11:27:35,425 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:27:35,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-11 11:27:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:27:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 11:27:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:27:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-11 11:27:35,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-11 11:27:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:35,435 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-11 11:27:35,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 11:27:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-11 11:27:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 11:27:35,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:35,435 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-11 11:27:35,436 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:35,436 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-11 11:27:35,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:35,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:35,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:35,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:35,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:35,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:35,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:35,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:35,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:35,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:35,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:35,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:35,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:35,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:36,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:36,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-11 11:27:36,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:36,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 11:27:36,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 11:27:36,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:27:36,278 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-11 11:27:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:36,307 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-11 11:27:36,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:27:36,311 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-11 11:27:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:36,311 INFO L225 Difference]: With dead ends: 20 [2019-01-11 11:27:36,311 INFO L226 Difference]: Without dead ends: 18 [2019-01-11 11:27:36,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:27:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-11 11:27:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-11 11:27:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 11:27:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-11 11:27:36,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-11 11:27:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:36,316 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-11 11:27:36,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 11:27:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-11 11:27:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 11:27:36,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:36,317 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-11 11:27:36,317 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:36,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-11 11:27:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:36,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:36,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:36,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:36,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:36,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:36,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:36,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:36,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:36,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:36,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:36,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:36,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:36,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-11 11:27:36,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:36,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:36,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:37,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:37,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-11 11:27:37,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:37,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 11:27:37,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 11:27:37,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:27:37,248 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-11 11:27:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:37,282 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-11 11:27:37,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 11:27:37,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-11 11:27:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:37,284 INFO L225 Difference]: With dead ends: 21 [2019-01-11 11:27:37,284 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 11:27:37,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:27:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 11:27:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-11 11:27:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 11:27:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-11 11:27:37,289 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-11 11:27:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:37,289 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-11 11:27:37,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 11:27:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-11 11:27:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 11:27:37,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:37,290 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-11 11:27:37,290 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-11 11:27:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:37,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:37,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:37,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:37,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:37,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:37,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:37,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:37,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:37,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:37,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:37,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:37,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:37,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:37,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:38,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:38,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-11 11:27:38,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:38,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 11:27:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 11:27:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:27:38,094 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-11 11:27:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:38,144 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-11 11:27:38,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 11:27:38,145 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-11 11:27:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:38,146 INFO L225 Difference]: With dead ends: 22 [2019-01-11 11:27:38,146 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:27:38,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:27:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:27:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-11 11:27:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 11:27:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-11 11:27:38,151 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-11 11:27:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:38,151 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-11 11:27:38,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 11:27:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-11 11:27:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 11:27:38,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:38,152 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-11 11:27:38,152 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-11 11:27:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:38,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:38,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:38,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:38,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:38,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:38,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:38,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:38,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:38,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:38,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:38,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:38,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:39,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:39,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-11 11:27:39,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:39,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-11 11:27:39,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-11 11:27:39,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 11:27:39,737 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-11 11:27:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:39,769 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-11 11:27:39,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:27:39,770 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-11 11:27:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:39,771 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:27:39,771 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 11:27:39,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 11:27:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 11:27:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-11 11:27:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:27:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-11 11:27:39,774 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-11 11:27:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:39,775 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-11 11:27:39,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-11 11:27:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-11 11:27:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 11:27:39,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:39,775 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-11 11:27:39,776 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-11 11:27:39,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:39,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:39,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:39,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:40,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:40,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:40,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:40,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:40,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:40,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:40,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:40,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:40,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-11 11:27:40,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:40,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:40,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:41,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:41,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-11 11:27:41,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:41,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 11:27:41,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 11:27:41,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:27:41,059 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-11 11:27:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:41,089 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-11 11:27:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:27:41,090 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-11 11:27:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:41,090 INFO L225 Difference]: With dead ends: 24 [2019-01-11 11:27:41,091 INFO L226 Difference]: Without dead ends: 22 [2019-01-11 11:27:41,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:27:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-11 11:27:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-11 11:27:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 11:27:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-11 11:27:41,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-11 11:27:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:41,097 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-11 11:27:41,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 11:27:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-11 11:27:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 11:27:41,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:41,098 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-11 11:27:41,098 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-11 11:27:41,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:41,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:41,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:41,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:41,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:41,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:41,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:41,872 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:41,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:41,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:41,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:41,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:41,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:41,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:41,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:41,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:41,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:42,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:42,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-11 11:27:42,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:42,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-11 11:27:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-11 11:27:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 11:27:42,339 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-11 11:27:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:42,377 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-11 11:27:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 11:27:42,377 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-11 11:27:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:42,378 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:27:42,379 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 11:27:42,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 11:27:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 11:27:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-11 11:27:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:27:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-11 11:27:42,384 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-11 11:27:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:42,385 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-11 11:27:42,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-11 11:27:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-11 11:27:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 11:27:42,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:42,386 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-11 11:27:42,386 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-11 11:27:42,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:42,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:42,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:42,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:42,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:42,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:42,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:42,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:42,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:42,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:42,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:42,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:42,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:43,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:43,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-11 11:27:43,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:43,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 11:27:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 11:27:43,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 11:27:43,166 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-11 11:27:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:43,229 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-11 11:27:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 11:27:43,232 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-11 11:27:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:43,232 INFO L225 Difference]: With dead ends: 26 [2019-01-11 11:27:43,232 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:27:43,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 11:27:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:27:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-11 11:27:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 11:27:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-11 11:27:43,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-11 11:27:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:43,237 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-11 11:27:43,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 11:27:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-11 11:27:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 11:27:43,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:43,238 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-11 11:27:43,238 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-11 11:27:43,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:43,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:43,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:43,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:43,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:43,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:43,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:43,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:43,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:43,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:43,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:43,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:43,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:43,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-11 11:27:43,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:43,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:43,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:44,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:44,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-11 11:27:44,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:44,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 11:27:44,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 11:27:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:27:44,129 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-11 11:27:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:44,176 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-11 11:27:44,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 11:27:44,177 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-11 11:27:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:44,177 INFO L225 Difference]: With dead ends: 27 [2019-01-11 11:27:44,178 INFO L226 Difference]: Without dead ends: 25 [2019-01-11 11:27:44,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:27:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-11 11:27:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-11 11:27:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 11:27:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-11 11:27:44,188 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-11 11:27:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:44,188 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-11 11:27:44,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 11:27:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-11 11:27:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 11:27:44,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:44,189 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-11 11:27:44,189 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-11 11:27:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:44,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:44,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:44,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:44,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:44,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:44,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:44,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:44,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:44,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:44,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:44,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:44,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:44,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:44,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:45,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:45,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-11 11:27:45,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:45,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 11:27:45,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 11:27:45,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:27:45,614 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-11 11:27:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:45,694 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-11 11:27:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 11:27:45,695 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-11 11:27:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:45,696 INFO L225 Difference]: With dead ends: 28 [2019-01-11 11:27:45,696 INFO L226 Difference]: Without dead ends: 26 [2019-01-11 11:27:45,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:27:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-11 11:27:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-11 11:27:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:27:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-11 11:27:45,701 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-11 11:27:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:45,701 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-11 11:27:45,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 11:27:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-11 11:27:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 11:27:45,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:45,702 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-11 11:27:45,702 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-11 11:27:45,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:45,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:45,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:45,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:45,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:45,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:45,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:45,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:45,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:45,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:45,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:45,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:45,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:46,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:46,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:46,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:46,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-11 11:27:46,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:46,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-11 11:27:46,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-11 11:27:46,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-11 11:27:46,640 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-11 11:27:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:46,675 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-11 11:27:46,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 11:27:46,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-11 11:27:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:46,678 INFO L225 Difference]: With dead ends: 29 [2019-01-11 11:27:46,678 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 11:27:46,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-11 11:27:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 11:27:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-11 11:27:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 11:27:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-11 11:27:46,683 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-11 11:27:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:46,684 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-11 11:27:46,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-11 11:27:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-11 11:27:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 11:27:46,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:46,685 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-11 11:27:46,685 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:46,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-11 11:27:46,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:46,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:46,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:47,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:47,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:47,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:47,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:47,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:47,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:47,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:47,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:47,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-11 11:27:47,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:47,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:47,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:47,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:47,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-11 11:27:47,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:47,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 11:27:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 11:27:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:27:47,855 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-11 11:27:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:47,902 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-11 11:27:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:27:47,903 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-11 11:27:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:47,903 INFO L225 Difference]: With dead ends: 30 [2019-01-11 11:27:47,903 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 11:27:47,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:27:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 11:27:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-11 11:27:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 11:27:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-11 11:27:47,909 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-11 11:27:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:47,910 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-11 11:27:47,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 11:27:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-11 11:27:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 11:27:47,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:47,910 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-11 11:27:47,911 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-11 11:27:47,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:47,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:47,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:48,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:48,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:48,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:48,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:48,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:48,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:48,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:48,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:48,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:48,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:48,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:48,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:49,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:49,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-11 11:27:49,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:49,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-11 11:27:49,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-11 11:27:49,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 11:27:49,434 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-11 11:27:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:49,524 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-11 11:27:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:27:49,524 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-11 11:27:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:49,525 INFO L225 Difference]: With dead ends: 31 [2019-01-11 11:27:49,525 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 11:27:49,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 11:27:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 11:27:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-11 11:27:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:27:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-11 11:27:49,530 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-11 11:27:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:49,531 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-11 11:27:49,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-11 11:27:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-11 11:27:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 11:27:49,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:49,532 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-11 11:27:49,532 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-11 11:27:49,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:49,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:49,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:49,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:49,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:49,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:49,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:49,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:49,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:49,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:49,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:49,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:49,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:49,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:51,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:51,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-11 11:27:51,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:51,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 11:27:51,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 11:27:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:27:51,183 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-11 11:27:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:51,244 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-11 11:27:51,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 11:27:51,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-11 11:27:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:51,246 INFO L225 Difference]: With dead ends: 32 [2019-01-11 11:27:51,246 INFO L226 Difference]: Without dead ends: 30 [2019-01-11 11:27:51,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:27:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-11 11:27:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-11 11:27:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:27:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-11 11:27:51,251 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-11 11:27:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:51,251 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-11 11:27:51,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 11:27:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-11 11:27:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 11:27:51,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:51,252 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-11 11:27:51,252 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-11 11:27:51,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:51,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:51,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:51,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:51,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:51,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:51,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:51,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:51,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:51,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:51,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:51,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:51,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:52,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-11 11:27:52,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:52,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:52,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:52,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:52,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-11 11:27:52,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:52,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 11:27:52,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 11:27:52,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:27:52,988 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-11 11:27:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:53,220 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-11 11:27:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 11:27:53,221 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-11 11:27:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:53,221 INFO L225 Difference]: With dead ends: 33 [2019-01-11 11:27:53,221 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 11:27:53,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:27:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 11:27:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 11:27:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:27:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-11 11:27:53,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-11 11:27:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:53,227 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-11 11:27:53,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 11:27:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-11 11:27:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 11:27:53,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:53,228 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-11 11:27:53,228 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-11 11:27:53,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:53,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:53,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:54,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:54,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:54,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:54,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:54,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:54,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:54,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:54,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:54,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:54,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:54,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:54,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:55,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:55,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-11 11:27:55,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:55,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 11:27:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 11:27:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 11:27:55,455 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-11 11:27:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:55,489 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-11 11:27:55,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 11:27:55,489 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-11 11:27:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:55,490 INFO L225 Difference]: With dead ends: 34 [2019-01-11 11:27:55,490 INFO L226 Difference]: Without dead ends: 32 [2019-01-11 11:27:55,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 11:27:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-11 11:27:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-11 11:27:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:27:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-11 11:27:55,496 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-11 11:27:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:55,496 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-11 11:27:55,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 11:27:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-11 11:27:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 11:27:55,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:55,497 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-11 11:27:55,497 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-11 11:27:55,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:55,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:55,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:55,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:55,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:55,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:55,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:55,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:55,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:55,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:55,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:55,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:55,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:57,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:57,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-11 11:27:57,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:57,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-11 11:27:57,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-11 11:27:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 11:27:57,031 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-11 11:27:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:57,121 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-11 11:27:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:27:57,122 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-11 11:27:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:57,122 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:27:57,122 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 11:27:57,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 11:27:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 11:27:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-11 11:27:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:27:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-11 11:27:57,127 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-11 11:27:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:57,127 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-11 11:27:57,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-11 11:27:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-11 11:27:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 11:27:57,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:57,128 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-11 11:27:57,128 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-11 11:27:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:57,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:57,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:57,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:57,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:57,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:57,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:57,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:57,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:57,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:57,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:57,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-11 11:27:57,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:57,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:57,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:58,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:58,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-11 11:27:58,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:58,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 11:27:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 11:27:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:27:58,770 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-11 11:27:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:58,826 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-11 11:27:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:27:58,827 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-11 11:27:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:58,827 INFO L225 Difference]: With dead ends: 36 [2019-01-11 11:27:58,827 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 11:27:58,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:27:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 11:27:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-11 11:27:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 11:27:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-11 11:27:58,832 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-11 11:27:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:58,832 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-11 11:27:58,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 11:27:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-11 11:27:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-11 11:27:58,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:58,832 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-11 11:27:58,832 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-11 11:27:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:58,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:58,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:59,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:59,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:59,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:59,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:59,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:59,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:27:59,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:59,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:59,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:59,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:59,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:59,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:00,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-11 11:28:00,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:00,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-11 11:28:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-11 11:28:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 11:28:00,641 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-11 11:28:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:00,726 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-11 11:28:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 11:28:00,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-11 11:28:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:00,727 INFO L225 Difference]: With dead ends: 37 [2019-01-11 11:28:00,727 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 11:28:00,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 11:28:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 11:28:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-11 11:28:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 11:28:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-11 11:28:00,731 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-11 11:28:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:00,731 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-11 11:28:00,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-11 11:28:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-11 11:28:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 11:28:00,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:00,732 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-11 11:28:00,732 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-11 11:28:00,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:00,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:00,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:01,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:01,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:01,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:01,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:01,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:01,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:01,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:01,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:01,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:01,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:02,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:02,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-11 11:28:02,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:02,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 11:28:02,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 11:28:02,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 11:28:02,496 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-11 11:28:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:02,563 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-11 11:28:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 11:28:02,563 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-11 11:28:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:02,564 INFO L225 Difference]: With dead ends: 38 [2019-01-11 11:28:02,564 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 11:28:02,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 11:28:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 11:28:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-11 11:28:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:28:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-11 11:28:02,568 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-11 11:28:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:02,569 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-11 11:28:02,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 11:28:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-11 11:28:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 11:28:02,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:02,569 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-11 11:28:02,570 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-11 11:28:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:02,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:03,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:03,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:03,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:03,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:03,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:03,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:03,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:03,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:03,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-11 11:28:03,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:03,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:03,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:04,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:04,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-11 11:28:04,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:04,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-11 11:28:04,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-11 11:28:04,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 11:28:04,766 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-11 11:28:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:04,836 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-11 11:28:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:28:04,837 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-11 11:28:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:04,838 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:28:04,838 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 11:28:04,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 11:28:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 11:28:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-11 11:28:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:28:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-11 11:28:04,841 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-11 11:28:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:04,842 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-11 11:28:04,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-11 11:28:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-11 11:28:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 11:28:04,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:04,842 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-11 11:28:04,843 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-11 11:28:04,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:04,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:04,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:04,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:04,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:05,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:05,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:05,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:05,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:05,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:05,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:05,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:05,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:05,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:05,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:05,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:05,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-11 11:28:06,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:06,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 11:28:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 11:28:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:28:06,875 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-11 11:28:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:06,975 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-11 11:28:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 11:28:06,975 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-11 11:28:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:06,976 INFO L225 Difference]: With dead ends: 40 [2019-01-11 11:28:06,976 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 11:28:06,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:28:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 11:28:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-11 11:28:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:28:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-11 11:28:06,980 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-11 11:28:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:06,980 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-11 11:28:06,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 11:28:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-11 11:28:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 11:28:06,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:06,980 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-11 11:28:06,980 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-11 11:28:06,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:06,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:06,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:06,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:07,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:07,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:07,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:07,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:07,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:07,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:07,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:07,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:07,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:07,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:08,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:08,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-11 11:28:08,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:08,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-11 11:28:08,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-11 11:28:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-11 11:28:08,991 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-11 11:28:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:09,063 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-11 11:28:09,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:28:09,063 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-11 11:28:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:09,064 INFO L225 Difference]: With dead ends: 41 [2019-01-11 11:28:09,064 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 11:28:09,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-11 11:28:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 11:28:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-11 11:28:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:28:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-11 11:28:09,068 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-11 11:28:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:09,068 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-11 11:28:09,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-11 11:28:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-11 11:28:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-11 11:28:09,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:09,069 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-11 11:28:09,069 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-11 11:28:09,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:09,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:09,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:09,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:09,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:09,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:09,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:09,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:09,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:09,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:09,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-11 11:28:09,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:09,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:09,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:11,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:11,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-11 11:28:11,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:11,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 11:28:11,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 11:28:11,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:28:11,503 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-11 11:28:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:11,562 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-11 11:28:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 11:28:11,563 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-11 11:28:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:11,563 INFO L225 Difference]: With dead ends: 42 [2019-01-11 11:28:11,563 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 11:28:11,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:28:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 11:28:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-11 11:28:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 11:28:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-11 11:28:11,567 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-11 11:28:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:11,567 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-11 11:28:11,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 11:28:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-11 11:28:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 11:28:11,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:11,568 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-11 11:28:11,568 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-11 11:28:11,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:11,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:11,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:12,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:12,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:12,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:12,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:12,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:12,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:12,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:12,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:12,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:12,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:12,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:12,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:13,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:13,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-11 11:28:13,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:13,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-11 11:28:13,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-11 11:28:13,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 11:28:13,976 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-11 11:28:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:14,033 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-11 11:28:14,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:28:14,034 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-11 11:28:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:14,034 INFO L225 Difference]: With dead ends: 43 [2019-01-11 11:28:14,035 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 11:28:14,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 11:28:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 11:28:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-11 11:28:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:28:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-11 11:28:14,038 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-11 11:28:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:14,038 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-11 11:28:14,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-11 11:28:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-11 11:28:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 11:28:14,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:14,039 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-11 11:28:14,039 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-11 11:28:14,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:14,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:14,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:16,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:16,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:16,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:16,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:16,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:16,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:16,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:16,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:16,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:16,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:17,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:17,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-11 11:28:17,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:17,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 11:28:17,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 11:28:17,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:28:17,653 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-11 11:28:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:17,731 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-11 11:28:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 11:28:17,732 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-11 11:28:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:17,732 INFO L225 Difference]: With dead ends: 44 [2019-01-11 11:28:17,732 INFO L226 Difference]: Without dead ends: 42 [2019-01-11 11:28:17,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:28:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-11 11:28:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-11 11:28:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 11:28:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-11 11:28:17,735 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-11 11:28:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:17,735 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-11 11:28:17,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 11:28:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-11 11:28:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-11 11:28:17,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:17,736 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-11 11:28:17,736 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-11 11:28:17,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:17,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:17,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:17,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:17,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:18,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:18,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:18,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:18,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:18,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:18,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:18,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:18,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-11 11:28:18,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:18,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:18,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:20,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:20,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-11 11:28:20,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:20,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-11 11:28:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-11 11:28:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:28:20,146 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-11 11:28:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:20,199 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-11 11:28:20,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 11:28:20,200 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-11 11:28:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:20,201 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:28:20,201 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 11:28:20,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:28:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 11:28:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-11 11:28:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-11 11:28:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-11 11:28:20,205 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-11 11:28:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:20,205 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-11 11:28:20,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-11 11:28:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-11 11:28:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 11:28:20,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:20,205 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-11 11:28:20,206 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-11 11:28:20,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:20,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:20,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:20,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:20,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:21,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:21,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:21,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:21,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:21,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:21,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:21,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:21,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:21,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:21,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:21,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:21,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:22,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:22,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-11 11:28:22,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:22,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 11:28:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 11:28:22,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 11:28:22,938 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-11 11:28:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:23,016 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-11 11:28:23,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 11:28:23,017 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-11 11:28:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:23,018 INFO L225 Difference]: With dead ends: 46 [2019-01-11 11:28:23,018 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:28:23,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 11:28:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:28:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-11 11:28:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-11 11:28:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-11 11:28:23,021 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-11 11:28:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:23,021 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-11 11:28:23,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 11:28:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-11 11:28:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 11:28:23,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:23,022 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-11 11:28:23,022 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:23,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-11 11:28:23,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:23,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:23,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:23,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:23,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:23,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:23,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:23,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:23,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:23,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:23,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:23,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:23,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:23,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:23,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:25,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:25,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-11 11:28:25,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:25,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-11 11:28:25,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-11 11:28:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-11 11:28:25,843 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-11 11:28:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:25,954 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-11 11:28:25,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 11:28:25,955 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-11 11:28:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:25,956 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:28:25,956 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:28:25,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-11 11:28:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:28:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-11 11:28:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 11:28:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-11 11:28:25,959 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-11 11:28:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:25,959 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-11 11:28:25,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-11 11:28:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-11 11:28:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 11:28:25,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:25,960 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-11 11:28:25,960 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:25,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-11 11:28:25,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:25,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:25,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:25,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:25,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:26,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:26,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:26,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:26,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:26,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:26,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:26,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:26,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:26,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-11 11:28:26,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:26,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:27,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:28,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-11 11:28:28,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:28,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 11:28:28,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 11:28:28,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:28:28,997 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-11 11:28:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:29,071 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-11 11:28:29,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:28:29,072 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-11 11:28:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:29,072 INFO L225 Difference]: With dead ends: 48 [2019-01-11 11:28:29,072 INFO L226 Difference]: Without dead ends: 46 [2019-01-11 11:28:29,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:28:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-11 11:28:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-11 11:28:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 11:28:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-11 11:28:29,074 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-11 11:28:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:29,075 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-11 11:28:29,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 11:28:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-11 11:28:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-11 11:28:29,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:29,075 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-11 11:28:29,075 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-11 11:28:29,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:29,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:29,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:29,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:30,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:30,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:30,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:30,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:30,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:30,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:30,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:30,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:30,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:30,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:30,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:30,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:32,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:32,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-11 11:28:32,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:32,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-11 11:28:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-11 11:28:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 11:28:32,458 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-11 11:28:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:32,515 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-11 11:28:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 11:28:32,515 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-11 11:28:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:32,515 INFO L225 Difference]: With dead ends: 49 [2019-01-11 11:28:32,515 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 11:28:32,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 11:28:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 11:28:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-11 11:28:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:28:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-11 11:28:32,519 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-11 11:28:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:32,520 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-11 11:28:32,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-11 11:28:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-11 11:28:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-11 11:28:32,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:32,521 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-11 11:28:32,521 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-11 11:28:32,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:32,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:32,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:33,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:33,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:33,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:33,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:33,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:33,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:33,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:33,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:33,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:33,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:35,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:35,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-11 11:28:35,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:35,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 11:28:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 11:28:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 11:28:35,563 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-11 11:28:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:35,642 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-11 11:28:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 11:28:35,642 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-11 11:28:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:35,643 INFO L225 Difference]: With dead ends: 50 [2019-01-11 11:28:35,643 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 11:28:35,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 11:28:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 11:28:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-11 11:28:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:28:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-11 11:28:35,648 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-11 11:28:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:35,648 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-11 11:28:35,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 11:28:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-11 11:28:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-11 11:28:35,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:35,649 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-11 11:28:35,649 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:35,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-11 11:28:35,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:35,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:35,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:35,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:35,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:36,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:36,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:36,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:36,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:36,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:36,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:36,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:36,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:36,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-11 11:28:36,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:36,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:36,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:38,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:38,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-11 11:28:38,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:38,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:28:38,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:28:38,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:28:38,984 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-11 11:28:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:39,107 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-11 11:28:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:28:39,107 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-11 11:28:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:39,108 INFO L225 Difference]: With dead ends: 51 [2019-01-11 11:28:39,108 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 11:28:39,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:28:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 11:28:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-11 11:28:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 11:28:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-11 11:28:39,112 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-11 11:28:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:39,112 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-11 11:28:39,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:28:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-11 11:28:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 11:28:39,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:39,113 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-11 11:28:39,113 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-11 11:28:39,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:39,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:39,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:40,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:40,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:40,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:40,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:40,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:40,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:40,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:40,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:40,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:40,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:40,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:40,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:42,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:42,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-11 11:28:42,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:42,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 11:28:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 11:28:42,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:28:42,622 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-11 11:28:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:42,933 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-11 11:28:42,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 11:28:42,934 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-11 11:28:42,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:42,934 INFO L225 Difference]: With dead ends: 52 [2019-01-11 11:28:42,935 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 11:28:42,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:28:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 11:28:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-11 11:28:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-11 11:28:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-11 11:28:42,937 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-11 11:28:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:42,937 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-11 11:28:42,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 11:28:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-11 11:28:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-11 11:28:42,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:42,938 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-11 11:28:42,938 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-11 11:28:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:42,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:42,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:43,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:43,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:43,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:43,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:43,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:43,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:43,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:43,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:43,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:43,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:46,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:46,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-11 11:28:46,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:46,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-11 11:28:46,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-11 11:28:46,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-11 11:28:46,628 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-11 11:28:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:46,717 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-11 11:28:46,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 11:28:46,718 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-11 11:28:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:46,718 INFO L225 Difference]: With dead ends: 53 [2019-01-11 11:28:46,719 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 11:28:46,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-11 11:28:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 11:28:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-11 11:28:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:28:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-11 11:28:46,721 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-11 11:28:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:46,721 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-11 11:28:46,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-11 11:28:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-11 11:28:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 11:28:46,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:46,722 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-11 11:28:46,722 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-11 11:28:46,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:46,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:46,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:46,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:46,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:47,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:47,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:47,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:47,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:47,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:47,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:47,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:47,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:47,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-11 11:28:47,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:47,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:48,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:50,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:50,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-11 11:28:50,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:50,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 11:28:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 11:28:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:28:50,496 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-11 11:28:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:50,557 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-11 11:28:50,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:28:50,557 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-11 11:28:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:50,558 INFO L225 Difference]: With dead ends: 54 [2019-01-11 11:28:50,558 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 11:28:50,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:28:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 11:28:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-11 11:28:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 11:28:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-11 11:28:50,563 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-11 11:28:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:50,563 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-11 11:28:50,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 11:28:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-11 11:28:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 11:28:50,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:50,564 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-11 11:28:50,564 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:50,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:50,565 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-11 11:28:50,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:50,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:50,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:50,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:51,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:51,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:51,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:51,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:51,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:51,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:51,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:51,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:51,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:51,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:51,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:51,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:54,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:54,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-11 11:28:54,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:54,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-11 11:28:54,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-11 11:28:54,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 11:28:54,464 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-11 11:28:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:54,603 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-11 11:28:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 11:28:54,604 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-11 11:28:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:54,605 INFO L225 Difference]: With dead ends: 55 [2019-01-11 11:28:54,605 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:28:54,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 11:28:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:28:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-11 11:28:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 11:28:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-11 11:28:54,609 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-11 11:28:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:54,609 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-11 11:28:54,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-11 11:28:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-11 11:28:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 11:28:54,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:54,610 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-11 11:28:54,610 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-11 11:28:54,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:54,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:54,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:54,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:55,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:55,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:55,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:55,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:55,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:55,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:28:55,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:55,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:55,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:55,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:58,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:58,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-11 11:28:58,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:58,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 11:28:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 11:28:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:28:58,906 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-11 11:28:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:58,966 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-11 11:28:58,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 11:28:58,966 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-11 11:28:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:58,967 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:28:58,967 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 11:28:58,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:28:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 11:28:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-11 11:28:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-11 11:28:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-11 11:28:58,971 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-11 11:28:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:58,971 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-11 11:28:58,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 11:28:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-11 11:28:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-11 11:28:58,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:58,972 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-11 11:28:58,972 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-11 11:28:58,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:58,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:58,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:58,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:58,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:00,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:00,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:00,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:00,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:00,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:00,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:00,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:29:00,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:29:00,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-11 11:29:00,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:00,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:00,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:03,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:03,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-11 11:29:03,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:03,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 11:29:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 11:29:03,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:29:03,346 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-11 11:29:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:03,501 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-11 11:29:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 11:29:03,501 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-11 11:29:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:03,502 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:29:03,502 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:29:03,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:29:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:29:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-11 11:29:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 11:29:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-11 11:29:03,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-11 11:29:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:03,505 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-11 11:29:03,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 11:29:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-11 11:29:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 11:29:03,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:03,506 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-11 11:29:03,506 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-11 11:29:03,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:03,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:03,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:03,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:03,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:04,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:04,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:04,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:04,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:04,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:04,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:04,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:29:04,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:29:04,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:29:04,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:04,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:04,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:07,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:07,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-11 11:29:07,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:07,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 11:29:07,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 11:29:07,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:29:07,620 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-11 11:29:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:07,717 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-11 11:29:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 11:29:07,718 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-11 11:29:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:07,718 INFO L225 Difference]: With dead ends: 58 [2019-01-11 11:29:07,719 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 11:29:07,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:29:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 11:29:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-11 11:29:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 11:29:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-11 11:29:07,722 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-11 11:29:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:07,722 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-11 11:29:07,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 11:29:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-11 11:29:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 11:29:07,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:07,722 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-11 11:29:07,723 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-11 11:29:07,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:07,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:07,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:08,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:08,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:08,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:08,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:08,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:08,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:08,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:08,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:29:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:08,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:08,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:12,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:12,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-11 11:29:12,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:12,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-11 11:29:12,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-11 11:29:12,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-11 11:29:12,122 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-11 11:29:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:12,222 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-11 11:29:12,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:29:12,223 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-11 11:29:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:12,223 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:29:12,224 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 11:29:12,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-11 11:29:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 11:29:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-11 11:29:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 11:29:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-11 11:29:12,227 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-11 11:29:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:12,227 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-11 11:29:12,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-11 11:29:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-11 11:29:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 11:29:12,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:12,228 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-11 11:29:12,228 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-11 11:29:12,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:12,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:12,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:12,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:12,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:13,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:13,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:13,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:13,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:13,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:13,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:13,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:29:13,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:29:13,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-11 11:29:13,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:13,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:13,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:16,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:16,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-11 11:29:16,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:16,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-11 11:29:16,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-11 11:29:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:29:16,680 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-11 11:29:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:16,772 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-11 11:29:16,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 11:29:16,773 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-11 11:29:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:16,773 INFO L225 Difference]: With dead ends: 60 [2019-01-11 11:29:16,774 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:29:16,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:29:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:29:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-11 11:29:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 11:29:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-11 11:29:16,777 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-11 11:29:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:16,777 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-11 11:29:16,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-11 11:29:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-11 11:29:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-11 11:29:16,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:16,778 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-11 11:29:16,778 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:16,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-11 11:29:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:16,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:16,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:16,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:16,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:18,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:18,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:18,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:18,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:18,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:18,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:18,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:29:18,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:29:18,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:29:18,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:18,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:18,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:21,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:21,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-11 11:29:21,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:21,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-11 11:29:21,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-11 11:29:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-11 11:29:21,223 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-11 11:29:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:21,332 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-11 11:29:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 11:29:21,332 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-11 11:29:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:21,333 INFO L225 Difference]: With dead ends: 61 [2019-01-11 11:29:21,333 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 11:29:21,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-11 11:29:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 11:29:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-11 11:29:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 11:29:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-11 11:29:21,336 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-11 11:29:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:21,336 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-11 11:29:21,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-11 11:29:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-11 11:29:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 11:29:21,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:21,336 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-11 11:29:21,337 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-11 11:29:21,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:21,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:21,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:21,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:21,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:23,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:23,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:23,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:23,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:23,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:23,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:23,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:23,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:29:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:23,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:23,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:26,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:26,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-11 11:29:26,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:26,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 11:29:26,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 11:29:26,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 11:29:26,473 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-11 11:29:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:26,593 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-11 11:29:26,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 11:29:26,595 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-11 11:29:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:26,596 INFO L225 Difference]: With dead ends: 62 [2019-01-11 11:29:26,596 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 11:29:26,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 11:29:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 11:29:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-11 11:29:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-11 11:29:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-11 11:29:26,599 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-11 11:29:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:26,599 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-11 11:29:26,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 11:29:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-11 11:29:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-11 11:29:26,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:26,600 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-11 11:29:26,600 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-11 11:29:26,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:26,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:26,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:26,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:28,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:28,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:28,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:28,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:28,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:28,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:28,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:29:28,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:29:28,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-11 11:29:28,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:28,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:28,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:31,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-11 11:29:31,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:31,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 11:29:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 11:29:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:29:31,850 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-11 11:29:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:31,927 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-11 11:29:31,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:29:31,928 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-11 11:29:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:31,929 INFO L225 Difference]: With dead ends: 63 [2019-01-11 11:29:31,929 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 11:29:31,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:29:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 11:29:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-11 11:29:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:29:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-11 11:29:31,934 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-11 11:29:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:31,934 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-11 11:29:31,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 11:29:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-11 11:29:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 11:29:31,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:31,935 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-11 11:29:31,935 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:31,936 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-11 11:29:31,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:31,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:31,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:33,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:33,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:33,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:33,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:33,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:33,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:33,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:29:33,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:29:33,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:29:33,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:33,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:33,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:37,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:37,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-11 11:29:37,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:37,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-11 11:29:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-11 11:29:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:29:37,037 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-11 11:29:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:37,145 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-11 11:29:37,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 11:29:37,145 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-11 11:29:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:37,146 INFO L225 Difference]: With dead ends: 64 [2019-01-11 11:29:37,146 INFO L226 Difference]: Without dead ends: 62 [2019-01-11 11:29:37,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:29:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-11 11:29:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-11 11:29:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-11 11:29:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-11 11:29:37,149 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-11 11:29:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:37,150 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-11 11:29:37,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-11 11:29:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-11 11:29:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-11 11:29:37,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:37,150 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-11 11:29:37,151 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:37,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:37,151 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-11 11:29:37,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:37,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:37,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:37,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:37,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:38,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:38,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:38,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:38,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:38,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:38,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:38,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:29:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:38,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:38,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:42,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:42,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-11 11:29:42,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:42,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-11 11:29:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-11 11:29:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-11 11:29:42,793 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-11 11:29:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:42,889 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-11 11:29:42,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 11:29:42,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-11 11:29:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:42,890 INFO L225 Difference]: With dead ends: 65 [2019-01-11 11:29:42,890 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 11:29:42,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-11 11:29:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 11:29:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-11 11:29:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 11:29:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-11 11:29:42,893 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-11 11:29:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:42,894 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-11 11:29:42,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-11 11:29:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-11 11:29:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-11 11:29:42,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:42,894 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-11 11:29:42,895 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-11 11:29:42,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:42,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:42,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:42,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:42,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:44,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:44,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:44,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:44,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:44,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:44,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:44,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:29:44,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:29:44,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-11 11:29:44,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:44,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:44,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:48,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:48,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-11 11:29:48,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:48,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-11 11:29:48,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-11 11:29:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:29:48,641 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-11 11:29:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:48,721 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-11 11:29:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:29:48,721 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-11 11:29:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:48,722 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:29:48,722 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 11:29:48,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:29:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 11:29:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-11 11:29:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 11:29:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-11 11:29:48,726 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-11 11:29:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:48,726 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-11 11:29:48,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-11 11:29:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-11 11:29:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-11 11:29:48,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:48,726 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-11 11:29:48,727 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:48,727 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-11 11:29:48,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:48,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:48,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:50,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:50,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:50,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:50,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:50,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:50,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:50,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:29:50,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:29:50,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:29:50,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:50,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:50,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:54,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-11 11:29:54,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:54,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-11 11:29:54,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-11 11:29:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-11 11:29:54,220 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-11 11:29:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:54,331 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-11 11:29:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:29:54,332 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-11 11:29:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:54,332 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:29:54,333 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:29:54,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-11 11:29:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:29:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-11 11:29:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-11 11:29:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-11 11:29:54,335 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-11 11:29:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:54,336 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-11 11:29:54,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-11 11:29:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-11 11:29:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-11 11:29:54,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:54,336 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-11 11:29:54,336 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-11 11:29:54,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:54,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:54,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:55,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:55,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:55,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:55,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:55,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:55,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:29:55,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:55,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:29:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:55,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:55,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:59,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:59,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-11 11:29:59,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:59,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 11:29:59,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 11:29:59,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:29:59,984 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-11 11:30:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:00,119 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-11 11:30:00,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 11:30:00,119 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-11 11:30:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:00,119 INFO L225 Difference]: With dead ends: 68 [2019-01-11 11:30:00,120 INFO L226 Difference]: Without dead ends: 66 [2019-01-11 11:30:00,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:30:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-11 11:30:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-11 11:30:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 11:30:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-11 11:30:00,123 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-11 11:30:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:00,123 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-11 11:30:00,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 11:30:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-11 11:30:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-11 11:30:00,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:00,123 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-11 11:30:00,124 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-11 11:30:00,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:00,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:00,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:00,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:01,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:01,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:01,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:01,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:01,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:01,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:30:01,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:30:01,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:30:02,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-11 11:30:02,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:02,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:02,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:06,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:06,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-11 11:30:06,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:06,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 11:30:06,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 11:30:06,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:30:06,322 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-11 11:30:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:06,446 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-11 11:30:06,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 11:30:06,447 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-11 11:30:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:06,447 INFO L225 Difference]: With dead ends: 69 [2019-01-11 11:30:06,447 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 11:30:06,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:30:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 11:30:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-11 11:30:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 11:30:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-11 11:30:06,451 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-11 11:30:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:06,452 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-11 11:30:06,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 11:30:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-11 11:30:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 11:30:06,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:06,452 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-11 11:30:06,452 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-11 11:30:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:06,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:06,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:06,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:08,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:08,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:08,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:08,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:08,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:08,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:30:08,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:30:08,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:30:09,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:30:09,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:09,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:09,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:13,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:13,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-11 11:30:13,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:13,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-11 11:30:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-11 11:30:13,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:30:13,767 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-11 11:30:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:13,890 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-11 11:30:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-11 11:30:13,891 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-11 11:30:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:13,892 INFO L225 Difference]: With dead ends: 70 [2019-01-11 11:30:13,892 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:30:13,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:30:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:30:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-11 11:30:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 11:30:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-11 11:30:13,896 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-11 11:30:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:13,896 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-11 11:30:13,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-11 11:30:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-11 11:30:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 11:30:13,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:13,897 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-11 11:30:13,897 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:13,898 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-11 11:30:13,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:13,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:13,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:13,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:13,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:15,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:15,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:15,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:15,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:15,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:15,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:30:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:15,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:30:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:15,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:15,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:20,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:20,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-11 11:30:20,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:20,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-11 11:30:20,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-11 11:30:20,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-11 11:30:20,172 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-11 11:30:20,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:20,262 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-11 11:30:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:30:20,263 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-11 11:30:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:20,263 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:30:20,264 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 11:30:20,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-11 11:30:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 11:30:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-11 11:30:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 11:30:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-11 11:30:20,268 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-11 11:30:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:20,268 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-11 11:30:20,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-11 11:30:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-11 11:30:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 11:30:20,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:20,269 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-11 11:30:20,269 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-11 11:30:20,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:20,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:20,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:20,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:20,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:22,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:22,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:22,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:22,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:22,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:22,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:30:22,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:30:22,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:30:23,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-11 11:30:23,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:23,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:23,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:28,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:28,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-11 11:30:28,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:28,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-11 11:30:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-11 11:30:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:30:28,106 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-11 11:30:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:28,209 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-11 11:30:28,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:30:28,209 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-11 11:30:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:28,210 INFO L225 Difference]: With dead ends: 72 [2019-01-11 11:30:28,210 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 11:30:28,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:30:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 11:30:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-11 11:30:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-11 11:30:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-11 11:30:28,215 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-11 11:30:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:28,215 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-11 11:30:28,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-11 11:30:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-11 11:30:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-11 11:30:28,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:28,216 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-11 11:30:28,216 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:28,216 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-11 11:30:28,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:28,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:28,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:28,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:28,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:30,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:30,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:30,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:30,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:30,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:30,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:30:30,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:30:30,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:30:30,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:30:30,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:30,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:30,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:35,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:35,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-11 11:30:35,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:35,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-11 11:30:35,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-11 11:30:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-11 11:30:35,109 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-11 11:30:35,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:35,455 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-11 11:30:35,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 11:30:35,455 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-11 11:30:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:35,456 INFO L225 Difference]: With dead ends: 73 [2019-01-11 11:30:35,456 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:30:35,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-11 11:30:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:30:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-11 11:30:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:30:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-11 11:30:35,460 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-11 11:30:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:35,460 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-11 11:30:35,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-11 11:30:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-11 11:30:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 11:30:35,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:35,461 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-11 11:30:35,461 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-11 11:30:35,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:35,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:35,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:37,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:37,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:37,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:37,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:37,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:37,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:30:37,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:37,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:30:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:37,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:37,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:42,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:42,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-11 11:30:42,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:42,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 11:30:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 11:30:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 11:30:42,379 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-11 11:30:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:42,470 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-11 11:30:42,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-11 11:30:42,471 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-11 11:30:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:42,472 INFO L225 Difference]: With dead ends: 74 [2019-01-11 11:30:42,472 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 11:30:42,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 11:30:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 11:30:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-11 11:30:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-11 11:30:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-11 11:30:42,476 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-11 11:30:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:42,477 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-11 11:30:42,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 11:30:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-11 11:30:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 11:30:42,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:42,478 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-11 11:30:42,478 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-11 11:30:42,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:42,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:42,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:44,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:44,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:44,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:44,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:44,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:44,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:30:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:30:44,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:30:44,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-11 11:30:44,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:44,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:44,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:50,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:50,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-11 11:30:50,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:50,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 11:30:50,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 11:30:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:30:50,172 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-11 11:30:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:50,384 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-11 11:30:50,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 11:30:50,385 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-11 11:30:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:50,385 INFO L225 Difference]: With dead ends: 75 [2019-01-11 11:30:50,386 INFO L226 Difference]: Without dead ends: 73 [2019-01-11 11:30:50,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:30:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-11 11:30:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-11 11:30:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 11:30:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-11 11:30:50,388 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-11 11:30:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:50,388 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-11 11:30:50,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 11:30:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-11 11:30:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 11:30:50,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:50,389 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-11 11:30:50,389 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-11 11:30:50,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:50,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:50,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:52,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:52,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:52,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:52,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:52,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:52,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:30:52,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:30:52,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:30:52,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:30:52,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:52,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:52,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:57,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:57,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-11 11:30:57,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:57,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-11 11:30:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-11 11:30:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:30:57,401 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-11 11:30:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:57,593 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-11 11:30:57,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 11:30:57,594 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-11 11:30:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:57,594 INFO L225 Difference]: With dead ends: 76 [2019-01-11 11:30:57,594 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 11:30:57,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:30:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 11:30:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-11 11:30:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 11:30:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-11 11:30:57,601 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-11 11:30:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:57,601 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-11 11:30:57,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-11 11:30:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-11 11:30:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-11 11:30:57,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:57,602 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-11 11:30:57,602 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-11 11:30:57,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:57,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:57,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:57,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:00,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:00,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:00,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:00,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:00,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:00,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:31:00,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:00,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:31:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:00,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:00,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:05,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:05,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-11 11:31:05,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:05,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-11 11:31:05,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-11 11:31:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-11 11:31:05,672 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-11 11:31:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:05,878 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-11 11:31:05,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 11:31:05,879 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-11 11:31:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:05,879 INFO L225 Difference]: With dead ends: 77 [2019-01-11 11:31:05,880 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 11:31:05,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-11 11:31:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 11:31:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-11 11:31:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 11:31:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-11 11:31:05,885 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-11 11:31:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:05,885 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-11 11:31:05,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-11 11:31:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-11 11:31:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-11 11:31:05,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:05,886 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-11 11:31:05,886 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:05,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-11 11:31:05,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:05,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:05,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:05,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:05,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:07,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:07,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:07,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:07,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:07,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:07,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:31:07,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:31:07,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:31:08,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-11 11:31:08,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:31:08,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:08,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:13,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:13,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-11 11:31:13,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:13,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 11:31:13,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 11:31:13,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:31:13,939 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-11 11:31:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:14,090 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-11 11:31:14,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 11:31:14,091 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-11 11:31:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:14,091 INFO L225 Difference]: With dead ends: 78 [2019-01-11 11:31:14,092 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 11:31:14,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:31:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 11:31:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-11 11:31:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 11:31:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-11 11:31:14,095 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-11 11:31:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:14,096 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-11 11:31:14,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 11:31:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-11 11:31:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-11 11:31:14,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:14,096 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-11 11:31:14,097 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-11 11:31:14,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:14,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:14,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:31:14,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:14,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:16,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:16,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:16,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:16,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:16,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:16,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:31:16,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:31:16,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:31:16,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:31:16,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:31:16,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:16,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:22,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:22,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-11 11:31:22,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:22,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-11 11:31:22,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-11 11:31:22,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-11 11:31:22,315 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-11 11:31:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:22,463 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-11 11:31:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:31:22,463 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-11 11:31:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:22,464 INFO L225 Difference]: With dead ends: 79 [2019-01-11 11:31:22,464 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 11:31:22,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-11 11:31:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 11:31:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-11 11:31:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:31:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-11 11:31:22,467 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-11 11:31:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:22,468 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-11 11:31:22,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-11 11:31:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-11 11:31:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 11:31:22,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:22,468 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-11 11:31:22,469 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-11 11:31:22,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:22,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:31:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:22,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:24,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:24,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:24,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:24,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:24,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:24,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:31:24,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:24,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:31:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:24,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:24,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:30,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:30,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-11 11:31:30,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:30,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 11:31:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 11:31:30,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:31:30,809 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-11 11:31:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:30,958 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-11 11:31:30,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 11:31:30,958 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-11 11:31:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:30,959 INFO L225 Difference]: With dead ends: 80 [2019-01-11 11:31:30,959 INFO L226 Difference]: Without dead ends: 78 [2019-01-11 11:31:30,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:31:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-11 11:31:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-11 11:31:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 11:31:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-11 11:31:30,961 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-11 11:31:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:30,962 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-11 11:31:30,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 11:31:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-11 11:31:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-11 11:31:30,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:30,962 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-11 11:31:30,962 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-11 11:31:30,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:30,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:30,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:30,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:30,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:32,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:32,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:32,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:32,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:32,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:32,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:31:32,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:31:32,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:31:33,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-11 11:31:33,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:31:33,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:33,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:39,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:39,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-11 11:31:39,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:39,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 11:31:39,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 11:31:39,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:31:39,952 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-11 11:31:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:40,075 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-11 11:31:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 11:31:40,075 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-11 11:31:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:40,076 INFO L225 Difference]: With dead ends: 81 [2019-01-11 11:31:40,076 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 11:31:40,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:31:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 11:31:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-11 11:31:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 11:31:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-11 11:31:40,079 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-11 11:31:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:40,080 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-11 11:31:40,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 11:31:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-11 11:31:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-11 11:31:40,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:40,081 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-11 11:31:40,081 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-11 11:31:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:40,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:31:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:40,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:42,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:42,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:42,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:42,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:42,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:42,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:31:42,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:31:42,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:31:42,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:31:42,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:31:42,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:42,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:49,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:49,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-11 11:31:49,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:49,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-11 11:31:49,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-11 11:31:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:31:49,723 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-11 11:31:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:49,859 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-11 11:31:49,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-11 11:31:49,860 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-11 11:31:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:49,860 INFO L225 Difference]: With dead ends: 82 [2019-01-11 11:31:49,861 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 11:31:49,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:31:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 11:31:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-11 11:31:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 11:31:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-11 11:31:49,864 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-11 11:31:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:49,864 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-11 11:31:49,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-11 11:31:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-11 11:31:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-11 11:31:49,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:49,864 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-11 11:31:49,864 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:49,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:49,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-11 11:31:49,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:49,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:31:49,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:49,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:52,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:52,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:52,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:52,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:52,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:52,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:31:52,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:52,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:31:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:52,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:52,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:59,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:59,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-11 11:31:59,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:59,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-11 11:31:59,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-11 11:31:59,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:31:59,231 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-11 11:31:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:59,601 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-11 11:31:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 11:31:59,601 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-11 11:31:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:59,602 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:31:59,602 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 11:31:59,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:31:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 11:31:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-11 11:31:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 11:31:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-11 11:31:59,605 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-11 11:31:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:59,605 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-11 11:31:59,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-11 11:31:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-11 11:31:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 11:31:59,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:59,606 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-11 11:31:59,606 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:59,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-11 11:31:59,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:59,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:59,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:59,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:59,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:02,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:02,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:02,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:02,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:02,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:02,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:32:02,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:32:02,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:32:02,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-11 11:32:02,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:32:02,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:02,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:09,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:09,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-11 11:32:09,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:09,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 11:32:09,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 11:32:09,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:32:09,664 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-11 11:32:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:10,260 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-11 11:32:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 11:32:10,261 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-11 11:32:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:10,262 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:32:10,262 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 11:32:10,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:32:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 11:32:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-11 11:32:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-11 11:32:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-11 11:32:10,266 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-11 11:32:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:10,266 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-11 11:32:10,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 11:32:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-11 11:32:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-11 11:32:10,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:10,267 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-11 11:32:10,267 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:10,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-11 11:32:10,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:10,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:32:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:10,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:12,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:12,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:12,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:12,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:12,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:12,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:32:12,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:32:12,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:32:13,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:32:13,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:32:13,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:13,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:20,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:20,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-11 11:32:20,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:20,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-11 11:32:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-11 11:32:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:32:20,205 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-11 11:32:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:20,362 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-11 11:32:20,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 11:32:20,362 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-11 11:32:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:20,362 INFO L225 Difference]: With dead ends: 85 [2019-01-11 11:32:20,363 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:32:20,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:32:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:32:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-11 11:32:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 11:32:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-11 11:32:20,367 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-11 11:32:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:20,367 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-11 11:32:20,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-11 11:32:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-11 11:32:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 11:32:20,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:20,367 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-11 11:32:20,368 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-11 11:32:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:20,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:32:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:20,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:23,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:23,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:23,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:23,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:32:23,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:32:23,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:32:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:23,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:23,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:30,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:30,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-11 11:32:30,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:30,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 11:32:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 11:32:30,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:32:30,091 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-11 11:32:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:30,210 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-11 11:32:30,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-11 11:32:30,210 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-11 11:32:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:30,211 INFO L225 Difference]: With dead ends: 86 [2019-01-11 11:32:30,211 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 11:32:30,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:32:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 11:32:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-11 11:32:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:32:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-11 11:32:30,215 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-11 11:32:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:30,215 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-11 11:32:30,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 11:32:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-11 11:32:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 11:32:30,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:30,216 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-11 11:32:30,216 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:30,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-11 11:32:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:32:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:30,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:32,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:32,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:32,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:32,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:32,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:32,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:32:32,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:32:32,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:32:33,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-11 11:32:33,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:32:33,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:33,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:40,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:40,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-11 11:32:40,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:40,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-11 11:32:40,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-11 11:32:40,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:32:40,767 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-11 11:32:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:40,962 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-11 11:32:40,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 11:32:40,962 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-11 11:32:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:40,963 INFO L225 Difference]: With dead ends: 87 [2019-01-11 11:32:40,963 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 11:32:40,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:32:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 11:32:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-11 11:32:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 11:32:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-11 11:32:40,966 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-11 11:32:40,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:40,966 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-11 11:32:40,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-11 11:32:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-11 11:32:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 11:32:40,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:40,967 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-11 11:32:40,967 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:40,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:40,967 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-11 11:32:40,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:40,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:40,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:32:40,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:40,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:43,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:43,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:43,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:43,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:43,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:43,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:32:43,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:32:43,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:32:43,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:32:43,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:32:43,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:43,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:50,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:50,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-11 11:32:50,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:50,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-11 11:32:50,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-11 11:32:50,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:32:50,923 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-11 11:32:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:51,109 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-11 11:32:51,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-11 11:32:51,109 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-11 11:32:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:51,110 INFO L225 Difference]: With dead ends: 88 [2019-01-11 11:32:51,110 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 11:32:51,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:32:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 11:32:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-11 11:32:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-11 11:32:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-11 11:32:51,113 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-11 11:32:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:51,114 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-11 11:32:51,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-11 11:32:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-11 11:32:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 11:32:51,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:51,115 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-11 11:32:51,115 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-11 11:32:51,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:51,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:32:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:51,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:53,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:53,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:53,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:53,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:53,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:53,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:32:53,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:32:53,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:32:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:53,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:53,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:01,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:01,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-11 11:33:01,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:01,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-11 11:33:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-11 11:33:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:33:01,235 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-11 11:33:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:01,472 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-11 11:33:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 11:33:01,472 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-11 11:33:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:01,473 INFO L225 Difference]: With dead ends: 89 [2019-01-11 11:33:01,473 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 11:33:01,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:33:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 11:33:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-11 11:33:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 11:33:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-11 11:33:01,477 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-11 11:33:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:01,477 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-11 11:33:01,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-11 11:33:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-11 11:33:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 11:33:01,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:01,478 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-11 11:33:01,478 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:01,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-11 11:33:01,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:01,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:01,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:33:01,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:01,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:04,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:04,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:04,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:04,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:04,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:04,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:33:04,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:33:04,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:33:05,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-11 11:33:05,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:33:05,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:33:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:05,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:13,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:13,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-11 11:33:13,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:13,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 11:33:13,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 11:33:13,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:33:13,100 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-11 11:33:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:13,242 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-11 11:33:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 11:33:13,242 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-11 11:33:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:13,243 INFO L225 Difference]: With dead ends: 90 [2019-01-11 11:33:13,243 INFO L226 Difference]: Without dead ends: 88 [2019-01-11 11:33:13,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:33:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-11 11:33:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-11 11:33:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-11 11:33:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-11 11:33:13,247 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-11 11:33:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:13,248 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-11 11:33:13,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 11:33:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-11 11:33:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-11 11:33:13,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:13,248 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-11 11:33:13,249 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-11 11:33:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:13,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:33:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:13,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:15,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:15,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:15,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:15,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:15,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:15,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:33:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:33:15,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:33:15,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:33:15,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:33:15,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:33:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:15,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:23,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:23,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-11 11:33:23,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:23,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-11 11:33:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-11 11:33:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:33:23,889 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-11 11:33:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:24,049 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-11 11:33:24,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 11:33:24,049 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-11 11:33:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:24,050 INFO L225 Difference]: With dead ends: 91 [2019-01-11 11:33:24,050 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:33:24,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:33:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:33:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-11 11:33:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-11 11:33:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-11 11:33:24,054 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-11 11:33:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:24,054 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-11 11:33:24,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-11 11:33:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-11 11:33:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-11 11:33:24,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:24,055 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-11 11:33:24,056 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:24,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-11 11:33:24,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:24,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:24,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:33:24,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:24,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:26,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:26,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:26,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:26,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:26,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:26,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:33:26,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:33:26,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:33:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:26,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:33:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:26,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:35,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:35,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-11 11:33:35,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:35,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 11:33:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 11:33:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:33:35,111 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-11 11:33:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:35,463 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-11 11:33:35,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-11 11:33:35,464 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-11 11:33:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:35,465 INFO L225 Difference]: With dead ends: 92 [2019-01-11 11:33:35,465 INFO L226 Difference]: Without dead ends: 90 [2019-01-11 11:33:35,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:33:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-11 11:33:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-11 11:33:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-11 11:33:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-11 11:33:35,468 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-11 11:33:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:35,469 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-11 11:33:35,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 11:33:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-11 11:33:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-11 11:33:35,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:35,469 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-11 11:33:35,470 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-11 11:33:35,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:35,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:35,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:33:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:35,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:38,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:38,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:38,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:38,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:38,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:38,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:33:38,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:33:38,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:33:39,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-11 11:33:39,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:33:39,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:33:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:39,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:47,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:47,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-11 11:33:47,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:47,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 11:33:47,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 11:33:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:33:47,768 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-11 11:33:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:47,978 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-11 11:33:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 11:33:47,978 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-11 11:33:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:47,979 INFO L225 Difference]: With dead ends: 93 [2019-01-11 11:33:47,979 INFO L226 Difference]: Without dead ends: 91 [2019-01-11 11:33:47,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:33:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-11 11:33:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-11 11:33:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:33:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-11 11:33:47,982 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-11 11:33:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:47,982 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-11 11:33:47,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 11:33:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-11 11:33:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 11:33:47,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:47,983 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-11 11:33:47,983 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-11 11:33:47,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:47,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:33:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:47,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:50,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:50,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:50,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:50,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:50,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:50,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:33:50,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:33:50,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:33:50,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:33:50,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:33:50,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:33:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:50,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:59,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:59,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-11 11:33:59,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:59,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-11 11:33:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-11 11:33:59,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:33:59,492 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-11 11:33:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:59,628 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-11 11:33:59,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-11 11:33:59,629 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-11 11:33:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:59,629 INFO L225 Difference]: With dead ends: 94 [2019-01-11 11:33:59,630 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 11:33:59,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:33:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 11:33:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-11 11:33:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-11 11:33:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-11 11:33:59,635 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-11 11:33:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:59,635 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-11 11:33:59,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-11 11:33:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-11 11:33:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-11 11:33:59,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:59,636 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-11 11:33:59,636 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-11 11:33:59,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:59,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:33:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:59,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:02,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:02,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:34:02,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:34:02,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:34:02,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:02,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:34:02,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:34:02,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:34:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:02,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:02,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:34:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:11,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:34:11,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-11 11:34:11,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:34:11,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-11 11:34:11,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-11 11:34:11,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:34:11,263 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-11 11:34:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:34:11,491 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-11 11:34:11,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 11:34:11,492 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-11 11:34:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:34:11,492 INFO L225 Difference]: With dead ends: 95 [2019-01-11 11:34:11,492 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 11:34:11,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:34:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 11:34:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-11 11:34:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 11:34:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-11 11:34:11,495 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-11 11:34:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:34:11,496 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-11 11:34:11,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-11 11:34:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-11 11:34:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-11 11:34:11,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:34:11,496 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-11 11:34:11,496 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:34:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:34:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-11 11:34:11,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:34:11,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:11,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:34:11,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:11,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:34:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:14,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:14,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:34:14,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:34:14,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:34:14,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:14,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:34:14,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:34:14,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:34:15,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-11 11:34:15,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:34:15,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:15,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:34:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:24,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:34:24,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-11 11:34:24,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:34:24,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 11:34:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 11:34:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:34:24,752 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-11 11:34:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:34:24,899 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-11 11:34:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-11 11:34:24,900 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-11 11:34:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:34:24,900 INFO L225 Difference]: With dead ends: 96 [2019-01-11 11:34:24,900 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 11:34:24,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:34:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 11:34:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-11 11:34:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-11 11:34:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-11 11:34:24,904 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-11 11:34:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:34:24,904 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-11 11:34:24,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 11:34:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-11 11:34:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-11 11:34:24,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:34:24,905 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-11 11:34:24,905 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:34:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:34:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-11 11:34:24,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:34:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:24,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:34:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:24,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:34:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:27,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:27,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:34:27,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:34:27,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:34:27,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:27,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:34:27,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:34:27,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:34:27,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:34:27,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:34:27,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:27,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:34:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:36,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:34:36,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-11 11:34:36,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:34:36,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-11 11:34:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-11 11:34:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:34:36,939 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-11 11:34:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:34:37,195 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-11 11:34:37,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-11 11:34:37,195 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-11 11:34:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:34:37,196 INFO L225 Difference]: With dead ends: 97 [2019-01-11 11:34:37,196 INFO L226 Difference]: Without dead ends: 95 [2019-01-11 11:34:37,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:34:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-11 11:34:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-11 11:34:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 11:34:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-11 11:34:37,200 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-11 11:34:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:34:37,200 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-11 11:34:37,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-11 11:34:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-11 11:34:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-11 11:34:37,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:34:37,201 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-11 11:34:37,201 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:34:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:34:37,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-11 11:34:37,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:34:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:37,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:34:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:37,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:34:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:40,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:40,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:34:40,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:34:40,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:34:40,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:40,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:34:40,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:34:40,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:34:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:40,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:40,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:34:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:49,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:34:49,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-11 11:34:49,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:34:49,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 11:34:49,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 11:34:49,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:34:49,721 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-11 11:34:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:34:49,956 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-11 11:34:49,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-11 11:34:49,956 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-11 11:34:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:34:49,957 INFO L225 Difference]: With dead ends: 98 [2019-01-11 11:34:49,957 INFO L226 Difference]: Without dead ends: 96 [2019-01-11 11:34:49,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:34:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-11 11:34:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-11 11:34:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 11:34:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-11 11:34:49,960 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-11 11:34:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:34:49,960 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-11 11:34:49,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 11:34:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-11 11:34:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 11:34:49,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:34:49,961 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-11 11:34:49,961 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:34:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:34:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-11 11:34:49,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:34:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:49,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:34:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:49,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:34:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:53,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:53,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:34:53,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:34:53,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:34:53,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:53,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:34:53,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:34:53,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:34:54,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-11 11:34:54,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:34:54,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:54,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:35:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:03,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:35:03,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-11 11:35:03,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:35:03,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 11:35:03,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 11:35:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 11:35:03,908 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-11 11:35:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:04,063 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-11 11:35:04,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-11 11:35:04,064 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-11 11:35:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:04,065 INFO L225 Difference]: With dead ends: 99 [2019-01-11 11:35:04,065 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 11:35:04,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 11:35:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 11:35:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-11 11:35:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 11:35:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-11 11:35:04,070 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-11 11:35:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:04,070 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-11 11:35:04,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 11:35:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-11 11:35:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 11:35:04,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:04,071 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-11 11:35:04,071 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-11 11:35:04,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:04,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:04,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:35:04,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:04,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:07,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:07,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:35:07,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:35:07,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:35:07,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:07,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:35:07,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:35:07,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:35:07,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:35:07,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:35:07,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:35:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:07,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:35:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:17,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:35:17,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-11 11:35:17,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:35:17,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-11 11:35:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-11 11:35:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:35:17,112 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-11 11:35:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:17,267 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-11 11:35:17,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-11 11:35:17,268 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-11 11:35:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:17,268 INFO L225 Difference]: With dead ends: 100 [2019-01-11 11:35:17,269 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 11:35:17,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:35:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 11:35:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-11 11:35:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-11 11:35:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-11 11:35:17,272 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-11 11:35:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:17,272 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-11 11:35:17,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-11 11:35:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-11 11:35:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 11:35:17,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:17,273 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-11 11:35:17,273 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-11 11:35:17,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:17,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:35:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:17,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:20,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:20,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:35:20,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:35:20,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:35:20,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:20,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:35:20,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:35:20,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:35:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:20,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:35:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:20,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:35:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:30,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:35:30,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-11 11:35:30,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:35:30,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-11 11:35:30,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-11 11:35:30,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 11:35:30,274 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-11 11:35:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:30,429 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-11 11:35:30,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-11 11:35:30,430 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-11 11:35:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:30,431 INFO L225 Difference]: With dead ends: 101 [2019-01-11 11:35:30,431 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 11:35:30,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 11:35:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 11:35:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-11 11:35:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-11 11:35:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-11 11:35:30,436 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-11 11:35:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:30,436 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-11 11:35:30,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-11 11:35:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-11 11:35:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 11:35:30,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:30,437 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-11 11:35:30,437 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-11 11:35:30,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:30,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:30,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:35:30,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:30,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:33,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:33,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:35:33,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:35:33,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:35:33,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:33,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:35:33,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:35:33,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:35:35,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-11 11:35:35,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:35:35,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:35:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:35,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:35:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:45,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:35:45,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-11 11:35:45,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:35:45,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-11 11:35:45,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-11 11:35:45,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:35:45,487 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-11 11:35:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:45,641 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-11 11:35:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-11 11:35:45,641 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-11 11:35:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:45,642 INFO L225 Difference]: With dead ends: 102 [2019-01-11 11:35:45,642 INFO L226 Difference]: Without dead ends: 100 [2019-01-11 11:35:45,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:35:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-11 11:35:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-11 11:35:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 11:35:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-11 11:35:45,646 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-11 11:35:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:45,646 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-11 11:35:45,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-11 11:35:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-11 11:35:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 11:35:45,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:45,647 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-11 11:35:45,647 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:45,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:45,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-11 11:35:45,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:45,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:45,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:35:45,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:45,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:49,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:49,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:35:49,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:35:49,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:35:49,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:49,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:35:49,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:35:49,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:35:49,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:35:49,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:35:49,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:35:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:49,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:35:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:59,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:35:59,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-11 11:35:59,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:35:59,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-11 11:35:59,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-11 11:35:59,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 11:35:59,648 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-11 11:35:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:59,869 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-11 11:35:59,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-11 11:35:59,869 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-11 11:35:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:59,870 INFO L225 Difference]: With dead ends: 103 [2019-01-11 11:35:59,870 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 11:35:59,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 11:35:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 11:35:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-11 11:35:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:35:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-11 11:35:59,874 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-11 11:35:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:59,874 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-11 11:35:59,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-11 11:35:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-11 11:35:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 11:35:59,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:59,875 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-11 11:35:59,875 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-11 11:35:59,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:59,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:35:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:59,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:03,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:03,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:36:03,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:36:03,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:36:03,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:03,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:36:03,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:36:03,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:36:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:03,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:36:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:03,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:36:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:13,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:36:13,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-11 11:36:13,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:36:13,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 11:36:13,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 11:36:13,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:36:13,952 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-11 11:36:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:36:14,253 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-11 11:36:14,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-11 11:36:14,254 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-11 11:36:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:36:14,254 INFO L225 Difference]: With dead ends: 104 [2019-01-11 11:36:14,254 INFO L226 Difference]: Without dead ends: 102 [2019-01-11 11:36:14,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:36:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-11 11:36:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-11 11:36:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-11 11:36:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-11 11:36:14,258 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-11 11:36:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:36:14,258 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-11 11:36:14,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 11:36:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-11 11:36:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-11 11:36:14,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:36:14,259 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-11 11:36:14,259 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:36:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:36:14,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-11 11:36:14,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:36:14,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:14,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:36:14,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:14,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:36:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:18,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:18,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:36:18,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:36:18,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:36:18,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:18,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:36:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:36:18,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:36:19,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-11 11:36:19,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:36:19,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:36:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:19,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:36:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:30,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:36:30,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-11 11:36:30,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:36:30,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 11:36:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 11:36:30,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-11 11:36:30,515 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-11 11:36:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:36:30,761 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-11 11:36:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-11 11:36:30,761 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-11 11:36:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:36:30,762 INFO L225 Difference]: With dead ends: 105 [2019-01-11 11:36:30,762 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 11:36:30,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-11 11:36:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 11:36:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-11 11:36:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 11:36:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-11 11:36:30,766 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-11 11:36:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:36:30,766 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-11 11:36:30,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 11:36:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-11 11:36:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 11:36:30,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:36:30,767 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-11 11:36:30,767 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:36:30,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:36:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-11 11:36:30,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:36:30,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:30,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:36:30,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:30,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:36:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:34,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:34,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:36:34,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:36:34,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:36:34,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:34,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:36:34,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:36:34,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:36:34,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:36:34,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:36:34,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:36:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:34,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:36:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:45,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:36:45,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-11 11:36:45,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:36:45,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-11 11:36:45,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-11 11:36:45,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 11:36:45,230 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-11 11:36:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:36:45,502 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-11 11:36:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-11 11:36:45,502 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-11 11:36:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:36:45,503 INFO L225 Difference]: With dead ends: 106 [2019-01-11 11:36:45,503 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 11:36:45,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 11:36:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 11:36:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-11 11:36:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-11 11:36:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-11 11:36:45,507 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-11 11:36:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:36:45,508 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-11 11:36:45,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-11 11:36:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-11 11:36:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 11:36:45,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:36:45,509 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-11 11:36:45,509 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:36:45,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:36:45,509 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-11 11:36:45,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:36:45,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:45,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:36:45,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:45,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:36:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:49,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:49,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:36:49,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:36:49,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:36:49,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:49,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:36:49,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:36:49,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:36:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:49,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:36:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:49,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:37:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:00,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:37:00,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-11 11:37:00,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:37:00,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-11 11:37:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-11 11:37:00,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-11 11:37:00,388 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-11 11:37:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:37:00,565 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-11 11:37:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-11 11:37:00,566 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-11 11:37:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:37:00,567 INFO L225 Difference]: With dead ends: 107 [2019-01-11 11:37:00,567 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 11:37:00,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-11 11:37:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 11:37:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-11 11:37:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 11:37:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-11 11:37:00,571 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-11 11:37:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:37:00,572 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-11 11:37:00,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-11 11:37:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-11 11:37:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 11:37:00,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:37:00,573 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-11 11:37:00,573 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:37:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:37:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-11 11:37:00,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:37:00,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:00,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:37:00,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:00,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:37:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:37:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:04,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:04,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:37:04,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:37:04,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:37:04,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:04,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:37:04,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:37:04,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:37:06,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-11 11:37:06,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:37:06,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:37:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:06,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:37:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:17,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:37:17,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-11 11:37:17,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:37:17,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-11 11:37:17,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-11 11:37:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:37:17,718 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-11 11:37:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:37:18,050 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-11 11:37:18,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-11 11:37:18,051 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-11 11:37:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:37:18,052 INFO L225 Difference]: With dead ends: 108 [2019-01-11 11:37:18,052 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 11:37:18,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:37:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 11:37:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-11 11:37:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 11:37:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-11 11:37:18,057 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-11 11:37:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:37:18,058 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-11 11:37:18,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-11 11:37:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-11 11:37:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 11:37:18,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:37:18,059 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-11 11:37:18,059 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:37:18,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:37:18,059 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-11 11:37:18,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:37:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:18,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:37:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:18,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:37:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:37:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:21,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:21,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:37:21,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:37:21,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:37:21,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:21,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:37:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:37:21,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:37:21,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:37:21,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:37:21,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:37:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:21,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:37:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:33,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:37:33,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-11 11:37:33,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:37:33,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-11 11:37:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-11 11:37:33,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 11:37:33,105 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-11 11:37:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:37:33,456 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-11 11:37:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-11 11:37:33,457 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-11 11:37:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:37:33,457 INFO L225 Difference]: With dead ends: 109 [2019-01-11 11:37:33,457 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 11:37:33,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 11:37:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 11:37:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-11 11:37:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 11:37:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-11 11:37:33,462 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-11 11:37:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:37:33,462 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-11 11:37:33,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-11 11:37:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-11 11:37:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 11:37:33,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:37:33,463 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-11 11:37:33,463 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:37:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:37:33,463 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-11 11:37:33,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:37:33,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:33,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:37:33,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:33,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:37:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:37:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:37,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:37,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:37:37,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:37:37,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:37:37,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:37,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:37:37,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:37:37,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:37:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:37:37,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:37:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:37,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:37:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:49,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:37:49,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-11 11:37:49,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:37:49,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 11:37:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 11:37:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 11:37:49,355 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-11 11:37:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:37:49,597 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-11 11:37:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-11 11:37:49,598 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-11 11:37:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:37:49,599 INFO L225 Difference]: With dead ends: 110 [2019-01-11 11:37:49,599 INFO L226 Difference]: Without dead ends: 108 [2019-01-11 11:37:49,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 11:37:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-11 11:37:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-11 11:37:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 11:37:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-11 11:37:49,604 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-11 11:37:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:37:49,604 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-11 11:37:49,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 11:37:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-11 11:37:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-11 11:37:49,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:37:49,605 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-11 11:37:49,605 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:37:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:37:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-11 11:37:49,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:37:49,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:49,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:37:49,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:49,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:37:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:37:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:53,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:53,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:37:53,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:37:53,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:37:53,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:53,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:37:53,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:37:53,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:37:55,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-11 11:37:55,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:37:55,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:37:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:55,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:38:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:07,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:38:07,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-11 11:38:07,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:38:07,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 11:38:07,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 11:38:07,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 11:38:07,558 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-11 11:38:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:38:07,806 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-11 11:38:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-11 11:38:07,806 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-11 11:38:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:38:07,807 INFO L225 Difference]: With dead ends: 111 [2019-01-11 11:38:07,807 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 11:38:07,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 11:38:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 11:38:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-11 11:38:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-11 11:38:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-11 11:38:07,811 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-11 11:38:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:38:07,811 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-11 11:38:07,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 11:38:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-11 11:38:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-11 11:38:07,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:38:07,811 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-11 11:38:07,812 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:38:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:38:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-11 11:38:07,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:38:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:07,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:38:07,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:07,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:38:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:38:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:12,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:12,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:38:12,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:38:12,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:38:12,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:12,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:38:12,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:38:12,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:38:12,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:38:12,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:38:12,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:38:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:12,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:38:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:24,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:38:24,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-11 11:38:24,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:38:24,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-11 11:38:24,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-11 11:38:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 11:38:24,364 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-11 11:38:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:38:24,648 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-11 11:38:24,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-11 11:38:24,649 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-11 11:38:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:38:24,649 INFO L225 Difference]: With dead ends: 112 [2019-01-11 11:38:24,649 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 11:38:24,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 11:38:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 11:38:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-11 11:38:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-11 11:38:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-11 11:38:24,653 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-11 11:38:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:38:24,654 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-11 11:38:24,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-11 11:38:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-11 11:38:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-11 11:38:24,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:38:24,654 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-11 11:38:24,655 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:38:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:38:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-11 11:38:24,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:38:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:24,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:38:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:24,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:38:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:38:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:28,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:28,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:38:28,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:38:28,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:38:28,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:28,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:38:28,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:38:28,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:38:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:38:28,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:38:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:28,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:38:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:41,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:38:41,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-11 11:38:41,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:38:41,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-11 11:38:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-11 11:38:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-11 11:38:41,481 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-11 11:38:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:38:41,751 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-11 11:38:41,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-11 11:38:41,752 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-11 11:38:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:38:41,752 INFO L225 Difference]: With dead ends: 113 [2019-01-11 11:38:41,752 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 11:38:41,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-11 11:38:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 11:38:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-11 11:38:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 11:38:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-11 11:38:41,757 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-11 11:38:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:38:41,757 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-11 11:38:41,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-11 11:38:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-11 11:38:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 11:38:41,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:38:41,758 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-11 11:38:41,758 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:38:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:38:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-11 11:38:41,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:38:41,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:41,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:38:41,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:41,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:38:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:38:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:45,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:45,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:38:45,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:38:45,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:38:45,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:45,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:38:46,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:38:46,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:38:48,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-11 11:38:48,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:38:48,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:38:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:48,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:39:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:39:01,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-11 11:39:01,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:39:01,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-11 11:39:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-11 11:39:01,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-11 11:39:01,339 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-11 11:39:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:39:01,682 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-11 11:39:01,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-11 11:39:01,682 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-11 11:39:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:39:01,683 INFO L225 Difference]: With dead ends: 114 [2019-01-11 11:39:01,683 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 11:39:01,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-11 11:39:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 11:39:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-11 11:39:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 11:39:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-11 11:39:01,687 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-11 11:39:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:39:01,687 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-11 11:39:01,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-11 11:39:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-11 11:39:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-11 11:39:01,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:39:01,688 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-11 11:39:01,688 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:39:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:39:01,689 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-11 11:39:01,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:39:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:01,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:39:01,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:01,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:39:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:39:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:06,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:06,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:39:06,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:39:06,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:39:06,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:06,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:39:06,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:39:06,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:39:06,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:39:06,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:39:06,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:39:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:06,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:39:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:18,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:39:18,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-11 11:39:18,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:39:18,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-11 11:39:18,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-11 11:39:18,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-11 11:39:18,849 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-11 11:39:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:39:19,122 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-11 11:39:19,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-11 11:39:19,123 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-11 11:39:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:39:19,123 INFO L225 Difference]: With dead ends: 115 [2019-01-11 11:39:19,123 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 11:39:19,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-11 11:39:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 11:39:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-11 11:39:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 11:39:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-11 11:39:19,129 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-11 11:39:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:39:19,129 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-11 11:39:19,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-11 11:39:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-11 11:39:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-11 11:39:19,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:39:19,130 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-11 11:39:19,130 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:39:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:39:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-11 11:39:19,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:39:19,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:19,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:39:19,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:19,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:39:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:39:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:23,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:23,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:39:23,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:39:23,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:39:23,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:23,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:39:23,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:39:23,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:39:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:39:23,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:39:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:23,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:39:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:36,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:39:36,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-11 11:39:36,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:39:36,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 11:39:36,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 11:39:36,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-11 11:39:36,875 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-11 11:39:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:39:37,095 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-11 11:39:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-11 11:39:37,095 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-11 11:39:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:39:37,096 INFO L225 Difference]: With dead ends: 116 [2019-01-11 11:39:37,096 INFO L226 Difference]: Without dead ends: 114 [2019-01-11 11:39:37,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-11 11:39:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-11 11:39:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-11 11:39:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-11 11:39:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-11 11:39:37,101 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-11 11:39:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:39:37,101 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-11 11:39:37,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 11:39:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-11 11:39:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-11 11:39:37,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:39:37,102 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-11 11:39:37,103 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:39:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:39:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-11 11:39:37,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:39:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:37,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:39:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:37,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:39:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:39:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:41,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:41,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:39:41,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:39:41,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:39:41,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:41,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:39:41,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:39:41,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:39:44,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-11 11:39:44,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:39:44,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:39:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:44,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:39:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:57,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:39:57,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-11 11:39:57,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:39:57,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-11 11:39:57,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-11 11:39:57,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-11 11:39:57,833 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-11 11:39:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:39:58,222 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-11 11:39:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-11 11:39:58,223 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-11 11:39:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:39:58,223 INFO L225 Difference]: With dead ends: 117 [2019-01-11 11:39:58,223 INFO L226 Difference]: Without dead ends: 115 [2019-01-11 11:39:58,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-11 11:39:58,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-11 11:39:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-11 11:39:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-11 11:39:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-11 11:39:58,229 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-11 11:39:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:39:58,229 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-11 11:39:58,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-11 11:39:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-11 11:39:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-11 11:39:58,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:39:58,230 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-11 11:39:58,230 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:39:58,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:39:58,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-11 11:39:58,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:39:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:58,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:39:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:58,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:39:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:40:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:40:02,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:40:02,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:40:02,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:40:02,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:40:02,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:40:02,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:40:02,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:40:02,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:40:02,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:40:02,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:40:02,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:40:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:40:02,965 INFO L316 TraceCheckSpWp]: Computing backward predicates...