java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:38:25,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:38:25,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:38:25,273 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:38:25,273 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:38:25,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:38:25,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:38:25,279 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:38:25,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:38:25,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:38:25,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:38:25,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:38:25,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:38:25,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:38:25,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:38:25,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:38:25,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:38:25,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:38:25,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:38:25,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:38:25,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:38:25,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:38:25,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:38:25,317 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:38:25,317 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:38:25,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:38:25,319 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:38:25,319 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:38:25,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:38:25,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:38:25,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:38:25,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:38:25,328 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:38:25,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:38:25,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:38:25,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:38:25,330 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:38:25,348 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:38:25,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:38:25,349 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:38:25,349 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:38:25,349 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:38:25,350 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:38:25,350 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:38:25,350 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:38:25,350 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:38:25,350 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:38:25,351 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:38:25,351 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:38:25,351 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:38:25,351 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:38:25,351 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:38:25,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:38:25,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:38:25,352 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:38:25,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:38:25,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:38:25,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:38:25,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:38:25,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:38:25,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:38:25,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:38:25,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:38:25,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:38:25,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:38:25,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:38:25,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:38:25,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:38:25,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:38:25,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:38:25,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:38:25,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:38:25,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:38:25,356 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:38:25,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:38:25,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:38:25,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:38:25,357 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:38:25,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:38:25,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:38:25,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:38:25,413 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:38:25,414 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:38:25,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl [2018-12-03 15:38:25,415 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl' [2018-12-03 15:38:25,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:38:25,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:38:25,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:38:25,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:38:25,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:38:25,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:38:25,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:38:25,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:38:25,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:38:25,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... [2018-12-03 15:38:25,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:38:25,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:38:25,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:38:25,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:38:25,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:38:25,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:38:25,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:38:25,795 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:38:25,795 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:38:25,796 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:38:25 BoogieIcfgContainer [2018-12-03 15:38:25,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:38:25,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:38:25,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:38:25,800 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:38:25,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:25" (1/2) ... [2018-12-03 15:38:25,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7218a705 and model type overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:38:25, skipping insertion in model container [2018-12-03 15:38:25,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:38:25" (2/2) ... [2018-12-03 15:38:25,804 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow1.i_3.bpl [2018-12-03 15:38:25,815 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:38:25,823 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:38:25,842 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:38:25,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:38:25,886 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:38:25,887 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:38:25,887 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:38:25,887 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:38:25,888 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:38:25,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:38:25,888 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:38:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:38:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:38:25,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:25,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:38:25,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:25,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:38:25,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:25,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:25,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:25,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:25,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:26,274 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:38:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:26,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:26,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:38:26,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:26,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:26,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:26,310 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:38:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:26,357 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:38:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:26,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:38:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:26,378 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:38:26,378 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:38:26,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:38:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:38:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:38:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:38:26,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:38:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:26,414 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:38:26,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:38:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:38:26,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:26,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:38:26,415 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:26,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 15:38:26,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:26,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:26,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:26,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:26,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:26,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:26,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:26,591 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:38:26,593 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:38:26,630 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:38:26,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:38:26,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:38:26,882 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 3 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:38:26,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:26,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:38:26,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:26,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:26,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:26,913 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:26,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:27,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:27,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:27,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 15:38:27,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:27,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:38:27,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:38:27,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:38:27,143 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 15:38:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:27,170 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:38:27,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:38:27,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 15:38:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:27,174 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:38:27,174 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:38:27,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:38:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:38:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:38:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:38:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:38:27,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-12-03 15:38:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:27,179 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:38:27,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:38:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:38:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:38:27,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:27,180 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:38:27,180 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:27,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:27,181 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 2 times [2018-12-03 15:38:27,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:27,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:27,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:27,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:27,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:27,649 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:38:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:27,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:27,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:27,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:27,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:27,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:27,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:27,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:27,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:27,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:38:27,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:27,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:27,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:27,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:27,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 15:38:27,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:27,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:38:27,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:38:27,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:38:27,891 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 15:38:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:28,035 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 15:38:28,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:38:28,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 15:38:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:28,037 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:38:28,037 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:38:28,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:38:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:38:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:38:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:38:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:38:28,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-12-03 15:38:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:28,043 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:38:28,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:38:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:38:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:38:28,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:28,045 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:38:28,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:28,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:28,045 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 3 times [2018-12-03 15:38:28,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:28,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:28,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:28,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:28,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:28,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:28,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:28,292 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:28,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:28,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:28,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:28,304 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:28,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:28,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:28,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:28,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:28,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:28,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:28,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 15:38:28,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:28,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:38:28,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:38:28,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:38:28,913 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 15:38:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:28,992 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 15:38:28,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:38:28,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 15:38:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:28,994 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:38:28,994 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:38:28,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:38:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:38:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:38:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:38:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:38:29,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-12-03 15:38:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:29,000 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:38:29,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:38:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:38:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:38:29,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:29,001 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:38:29,002 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:29,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 4 times [2018-12-03 15:38:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:29,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:29,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:29,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:29,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:29,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:29,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:29,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:29,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:29,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:29,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:29,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:29,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:29,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:29,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 15:38:29,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:29,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:38:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:38:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:38:29,608 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 15:38:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:29,774 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 15:38:29,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:38:29,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 15:38:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:29,778 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:38:29,778 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:38:29,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:38:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:38:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:38:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:38:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:38:29,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-12-03 15:38:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:29,786 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:38:29,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:38:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:38:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:38:29,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:29,787 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:38:29,787 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:29,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:29,787 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 5 times [2018-12-03 15:38:29,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:29,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:29,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:29,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:30,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:30,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:30,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:30,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:30,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:30,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:30,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:30,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:30,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:38:30,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:30,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:30,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:31,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:31,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 15:38:31,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:31,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:38:31,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:38:31,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:38:31,018 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 15:38:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:31,138 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-03 15:38:31,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:38:31,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 15:38:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:31,140 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:38:31,140 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:38:31,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:38:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:38:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:38:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:38:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:38:31,146 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-12-03 15:38:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:31,146 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:38:31,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:38:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:38:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:38:31,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:31,147 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 15:38:31,147 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:31,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 6 times [2018-12-03 15:38:31,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:31,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:31,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:31,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:31,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:31,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:31,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:31,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:31,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:31,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:31,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:31,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:31,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:31,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:31,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:31,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:31,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:31,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:31,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 15:38:31,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:31,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:38:31,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:38:31,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:38:31,895 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 15:38:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:32,045 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-03 15:38:32,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:38:32,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 15:38:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:32,048 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:38:32,048 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:38:32,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:38:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:38:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:38:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:38:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 15:38:32,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-12-03 15:38:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:32,053 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 15:38:32,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:38:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 15:38:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:38:32,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:32,053 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 15:38:32,054 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:32,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 7 times [2018-12-03 15:38:32,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:32,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:32,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:32,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:32,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:32,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:32,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:32,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:32,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:32,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:32,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:32,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:32,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:33,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:33,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 15:38:33,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:33,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:38:33,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:38:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:38:33,365 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 15:38:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:33,559 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 15:38:33,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:38:33,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:38:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:33,566 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:38:33,566 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:38:33,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:38:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:38:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:38:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:38:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:38:33,572 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-12-03 15:38:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:33,572 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:38:33,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:38:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:38:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:38:33,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:33,573 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 15:38:33,574 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:33,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 8 times [2018-12-03 15:38:33,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:33,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:33,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:33,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:33,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:33,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:33,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:33,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:33,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:33,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:33,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:33,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:37,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 15:38:37,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:37,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:37,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:37,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:37,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 15:38:37,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:37,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:38:37,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:38:37,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:38:37,994 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 15:38:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:38,427 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-03 15:38:38,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:38:38,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 15:38:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:38,428 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:38:38,428 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:38:38,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:38:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:38:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:38:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:38:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 15:38:38,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-12-03 15:38:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:38,434 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 15:38:38,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:38:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 15:38:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:38:38,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:38,435 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 15:38:38,435 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:38,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:38,436 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 9 times [2018-12-03 15:38:38,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:38,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:38,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:38,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:38,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:38,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:38,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:38,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:38,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:38,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:38,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:38,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:38,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:38,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:38,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:38,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:39,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:39,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:39,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 15:38:39,807 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:39,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:38:39,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:38:39,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:38:39,809 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 15:38:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:40,180 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-03 15:38:40,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:38:40,180 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 15:38:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:40,181 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:38:40,182 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:38:40,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:38:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:38:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:38:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:38:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:38:40,189 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-12-03 15:38:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:40,189 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:38:40,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:38:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:38:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:38:40,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:40,190 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 15:38:40,191 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:40,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 10 times [2018-12-03 15:38:40,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:40,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:40,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:41,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:41,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:41,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:41,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:41,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:41,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:41,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:41,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:41,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:41,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:42,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:42,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 15:38:42,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:42,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:38:42,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:38:42,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:38:42,040 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 15:38:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:42,362 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 15:38:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:38:42,363 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 15:38:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:42,364 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:38:42,364 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:38:42,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:38:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:38:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:38:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:38:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:38:42,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-12-03 15:38:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:42,371 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:38:42,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:38:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:38:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:38:42,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:42,372 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 15:38:42,372 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:42,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 11 times [2018-12-03 15:38:42,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:42,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:42,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:42,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:42,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:42,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:42,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:42,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:42,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:42,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:42,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:43,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:38:43,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:43,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:43,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:44,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:44,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 15:38:44,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:44,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:38:44,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:38:44,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1585, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:38:44,326 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 15:38:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:44,734 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-12-03 15:38:44,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:38:44,735 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 15:38:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:44,736 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:38:44,736 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:38:44,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=577, Invalid=1585, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:38:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:38:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:38:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:38:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:38:44,743 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-12-03 15:38:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:44,743 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:38:44,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:38:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:38:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:38:44,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:44,744 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 15:38:44,744 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:44,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 12 times [2018-12-03 15:38:44,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:44,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:44,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:44,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:44,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:45,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:45,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:45,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:45,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:45,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:45,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:45,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:45,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:45,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:45,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:45,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:45,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:47,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:47,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 15:38:47,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:47,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:38:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:38:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=1873, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:38:47,949 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 15:38:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:48,840 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-03 15:38:48,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:38:48,842 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 15:38:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:48,842 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:38:48,843 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:38:48,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=677, Invalid=1873, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:38:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:38:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:38:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:38:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 15:38:48,849 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-12-03 15:38:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:48,849 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 15:38:48,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:38:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 15:38:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:38:48,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:48,850 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 15:38:48,851 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:48,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:48,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 13 times [2018-12-03 15:38:48,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:48,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:48,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:48,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:48,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:49,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:49,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:49,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:49,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:49,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:49,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:49,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:49,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:49,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:49,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:51,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:51,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 15:38:51,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:51,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:38:51,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:38:51,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:38:51,850 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 15:38:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:52,338 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 15:38:52,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:38:52,339 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 15:38:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:52,340 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:38:52,340 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:38:52,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:38:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:38:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:38:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:38:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:38:52,347 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-12-03 15:38:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:52,347 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:38:52,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:38:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:38:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:38:52,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:52,348 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 15:38:52,348 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:52,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 14 times [2018-12-03 15:38:52,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:52,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:52,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:52,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:52,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:53,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:53,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:53,035 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:53,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:53,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:53,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:53,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:53,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:39:52,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 15:39:52,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:52,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:52,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:54,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:54,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 15:39:54,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:54,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:39:54,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:39:54,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2521, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:39:54,557 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 15:39:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:55,625 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-03 15:39:55,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:39:55,625 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 15:39:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:55,626 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:39:55,626 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:39:55,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=901, Invalid=2521, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:39:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:39:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:39:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:39:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 15:39:55,633 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-12-03 15:39:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:55,633 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 15:39:55,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:39:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 15:39:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:39:55,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:55,634 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 15:39:55,634 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:55,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 15 times [2018-12-03 15:39:55,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:55,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:55,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:56,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:56,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:56,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:56,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:56,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:56,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:39:56,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:39:56,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:39:56,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:56,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:56,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:58,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:58,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 15:39:58,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:58,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:39:58,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:39:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1025, Invalid=2881, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:39:58,428 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 15:39:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:59,329 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-03 15:39:59,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:39:59,330 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 15:39:59,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:59,331 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:39:59,331 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:39:59,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1025, Invalid=2881, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:39:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:39:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:39:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:39:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 15:39:59,339 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-12-03 15:39:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:59,340 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 15:39:59,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:39:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 15:39:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:39:59,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:59,341 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 15:39:59,341 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:59,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:59,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 16 times [2018-12-03 15:39:59,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:59,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:59,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:59,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:59,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:00,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:00,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:00,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:00,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:00,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:00,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:00,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:00,428 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:00,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:00,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:02,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:02,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 15:40:02,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:02,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:40:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:40:02,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=3265, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:40:02,690 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 15:40:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:03,410 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 15:40:03,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:40:03,412 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 15:40:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:03,413 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:40:03,413 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:40:03,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1157, Invalid=3265, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:40:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:40:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:40:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:40:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 15:40:03,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-12-03 15:40:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:03,420 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 15:40:03,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:40:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 15:40:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:40:03,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:03,422 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 15:40:03,422 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:03,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 17 times [2018-12-03 15:40:03,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:03,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:03,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:04,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:04,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:04,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:04,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:04,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:04,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:04,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:40:04,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:39,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:43:39,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:41,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:41,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:43,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:43,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2018-12-03 15:43:43,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:43,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:43:43,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:43:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1297, Invalid=3673, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:43:43,511 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-12-03 15:43:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:44,286 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-12-03 15:43:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:43:44,287 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-12-03 15:43:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:44,288 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:43:44,288 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:43:44,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1297, Invalid=3673, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:43:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:43:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 15:43:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:43:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 15:43:44,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-12-03 15:43:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:44,296 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 15:43:44,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:43:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 15:43:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:43:44,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:44,297 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 15:43:44,297 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:44,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:44,297 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 18 times [2018-12-03 15:43:44,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:44,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:44,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:44,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:46,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:46,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:46,216 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:46,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:46,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:46,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:46,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:46,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:46,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:46,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:46,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:46,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:48,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:48,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2018-12-03 15:43:48,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:48,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:43:48,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:43:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=4105, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:43:48,883 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-12-03 15:43:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:49,771 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-03 15:43:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:43:49,771 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-12-03 15:43:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:49,772 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:43:49,773 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:43:49,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1445, Invalid=4105, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:43:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:43:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 15:43:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:43:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 15:43:49,779 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-12-03 15:43:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:49,779 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 15:43:49,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:43:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 15:43:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:43:49,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:49,780 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 15:43:49,781 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:49,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:49,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 19 times [2018-12-03 15:43:49,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:49,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:49,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:49,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:49,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:51,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:51,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:51,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:51,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:51,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:51,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:51,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:51,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:51,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:51,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:54,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:54,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2018-12-03 15:43:54,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:54,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:43:54,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:43:54,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:43:54,067 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-12-03 15:43:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:55,040 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 15:43:55,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:43:55,040 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-12-03 15:43:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:55,041 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:43:55,041 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:43:55,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:43:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:43:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:43:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:43:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 15:43:55,048 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-12-03 15:43:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:55,048 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 15:43:55,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:43:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 15:43:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:43:55,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:55,049 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 15:43:55,049 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:55,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:55,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 20 times [2018-12-03 15:43:55,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:55,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:55,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:55,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:55,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:56,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:56,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:56,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:56,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:56,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:56,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:56,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:56,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:18,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 15:46:18,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:18,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:19,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:22,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:22,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2018-12-03 15:46:22,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:22,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:46:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:46:22,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1765, Invalid=5041, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:46:22,366 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-12-03 15:46:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:23,412 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-03 15:46:23,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:46:23,413 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-12-03 15:46:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:23,413 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:46:23,414 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:46:23,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1765, Invalid=5041, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:46:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:46:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 15:46:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:46:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 15:46:23,421 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-12-03 15:46:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:23,421 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 15:46:23,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:46:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 15:46:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:46:23,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:23,423 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 15:46:23,423 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:23,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:23,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 21 times [2018-12-03 15:46:23,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:23,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:23,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:23,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:23,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:25,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:25,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:25,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:25,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:25,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:25,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:25,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:25,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:25,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:25,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:25,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:25,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:28,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:28,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 86 [2018-12-03 15:46:28,593 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:28,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:46:28,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:46:28,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:46:28,594 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-12-03 15:46:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:29,994 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-03 15:46:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:46:29,997 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-03 15:46:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:29,998 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:46:29,998 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:46:30,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:46:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:46:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:46:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:46:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 15:46:30,006 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-12-03 15:46:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:30,006 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 15:46:30,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:46:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 15:46:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:46:30,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:30,007 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 15:46:30,007 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:30,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 22 times [2018-12-03 15:46:30,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:30,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:30,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:30,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:30,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:31,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:31,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:31,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:31,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:31,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:31,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:31,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:31,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:31,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:31,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:35,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:35,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 90 [2018-12-03 15:46:35,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:35,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:46:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:46:35,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:46:35,219 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-12-03 15:46:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:36,492 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 15:46:36,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:46:36,493 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-12-03 15:46:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:36,494 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:46:36,494 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:46:36,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:46:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:46:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:46:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:46:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 15:46:36,501 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-12-03 15:46:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:36,501 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 15:46:36,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:46:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 15:46:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:46:36,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:36,502 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 15:46:36,502 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:36,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 23 times [2018-12-03 15:46:36,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:36,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:36,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:36,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:37,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:37,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:37,871 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:37,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:37,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:37,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:37,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:37,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:40,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:48:40,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:40,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:41,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:45,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:45,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2018-12-03 15:48:45,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:45,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:48:45,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:48:45,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:48:45,227 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-12-03 15:48:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:46,576 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-12-03 15:48:46,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:48:46,577 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-12-03 15:48:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:46,578 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:48:46,578 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:48:46,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:48:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:48:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:48:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:48:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 15:48:46,584 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-12-03 15:48:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:46,584 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 15:48:46,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:48:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 15:48:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:48:46,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:46,585 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 15:48:46,585 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:46,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 24 times [2018-12-03 15:48:46,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:46,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:46,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:48,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:48,091 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:48,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:48,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:48,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:48,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:48,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:48,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:48,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:48,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:48,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:52,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:52,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 98 [2018-12-03 15:48:52,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:52,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:48:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:48:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2501, Invalid=7201, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:48:52,523 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-12-03 15:48:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:54,133 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-03 15:48:54,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:48:54,134 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-12-03 15:48:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:54,134 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:48:54,135 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:48:54,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2501, Invalid=7201, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:48:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:48:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:48:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:48:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 15:48:54,142 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-12-03 15:48:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:54,142 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 15:48:54,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:48:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 15:48:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:48:54,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:54,143 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 15:48:54,143 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:54,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 25 times [2018-12-03 15:48:54,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:54,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:54,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:54,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:54,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:55,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:55,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:55,624 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:55,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:55,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:55,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:55,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:55,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:55,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:55,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:00,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:00,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 102 [2018-12-03 15:49:00,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:00,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:49:00,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:49:00,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2705, Invalid=7801, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:49:00,682 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-12-03 15:49:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:02,292 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 15:49:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:49:02,292 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-12-03 15:49:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:02,293 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:49:02,293 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:49:02,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2705, Invalid=7801, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:49:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:49:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:49:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:49:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 15:49:02,298 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-12-03 15:49:02,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:02,299 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 15:49:02,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:49:02,299 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 15:49:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:49:02,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:02,300 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 15:49:02,300 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:02,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:02,300 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 26 times [2018-12-03 15:49:02,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:02,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:02,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:02,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:02,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:04,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:04,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:04,197 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:04,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:04,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:04,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:04,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:04,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:38,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 15:51:38,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:39,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:39,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:44,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:44,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 106 [2018-12-03 15:51:44,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:44,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:51:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:51:44,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2917, Invalid=8425, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:51:44,586 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-12-03 15:51:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:46,428 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-03 15:51:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:51:46,429 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-12-03 15:51:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:46,430 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:51:46,430 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:51:46,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2917, Invalid=8425, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:51:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:51:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:51:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:51:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 15:51:46,436 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-12-03 15:51:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:46,437 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 15:51:46,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:51:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 15:51:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:51:46,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:46,438 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 15:51:46,438 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:46,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 27 times [2018-12-03 15:51:46,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:46,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:46,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:49,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:49,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:49,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:49,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:49,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:49,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:49,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:49,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:49,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:49,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:49,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:50,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:55,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:55,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 110 [2018-12-03 15:51:55,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:55,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:51:55,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:51:55,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3137, Invalid=9073, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 15:51:55,918 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-12-03 15:51:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:57,924 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-12-03 15:51:57,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:51:57,924 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-12-03 15:51:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:57,925 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:51:57,925 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:51:57,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=3137, Invalid=9073, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 15:51:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:51:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:51:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:51:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 15:51:57,930 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-12-03 15:51:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:57,930 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 15:51:57,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:51:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 15:51:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:51:57,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:57,931 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 15:51:57,931 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:57,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 28 times [2018-12-03 15:51:57,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:57,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:57,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:59,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:59,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:59,646 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:59,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:59,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:59,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:59,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:59,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:59,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:59,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:05,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:05,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 114 [2018-12-03 15:52:05,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:05,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:52:05,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:52:05,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3365, Invalid=9745, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:52:05,974 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-12-03 15:52:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:08,125 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 15:52:08,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:52:08,126 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-12-03 15:52:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:08,127 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:52:08,127 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:52:08,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3365, Invalid=9745, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:52:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:52:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:52:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:52:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 15:52:08,133 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-12-03 15:52:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:08,133 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 15:52:08,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:52:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 15:52:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:52:08,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:08,136 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 15:52:08,136 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:08,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 29 times [2018-12-03 15:52:08,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:08,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:08,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:09,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:09,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:09,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:09,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:09,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:09,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:09,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:09,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)