java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:29:08,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:29:08,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:29:08,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:29:08,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:29:08,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:29:08,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:29:08,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:29:08,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:29:08,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:29:08,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:29:08,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:29:08,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:29:08,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:29:08,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:29:08,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:29:08,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:29:08,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:29:08,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:29:08,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:29:08,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:29:08,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:29:08,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:29:08,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:29:08,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:29:08,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:29:08,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:29:08,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:29:08,357 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:29:08,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:29:08,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:29:08,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:29:08,360 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:29:08,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:29:08,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:29:08,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:29:08,362 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 [2019-01-07 21:29:08,376 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:29:08,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:29:08,377 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:29:08,377 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:29:08,378 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:29:08,378 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:29:08,378 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:29:08,378 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:29:08,378 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:29:08,379 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:29:08,379 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:29:08,379 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:29:08,379 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:29:08,379 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:29:08,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:29:08,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:29:08,380 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:29:08,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:29:08,381 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:29:08,381 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:29:08,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:29:08,381 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:29:08,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:29:08,382 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:29:08,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:29:08,382 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:29:08,383 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:29:08,383 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:29:08,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:29:08,383 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:29:08,383 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:29:08,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:29:08,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:29:08,384 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:29:08,384 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:29:08,384 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:29:08,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:29:08,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:29:08,385 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:29:08,385 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:29:08,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:29:08,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:29:08,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:29:08,460 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:29:08,461 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:29:08,462 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-01-07 21:29:08,463 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-07 21:29:08,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:29:08,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:29:08,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:29:08,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:29:08,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:29:08,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:29:08,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:29:08,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:29:08,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:29:08,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:29:08,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:29:08,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:29:08,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:29:08,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (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 [2019-01-07 21:29:08,648 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-07 21:29:08,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:29:08,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:29:08,940 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:29:08,941 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-07 21:29:08,942 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:29:08 BoogieIcfgContainer [2019-01-07 21:29:08,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:29:08,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:29:08,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:29:08,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:29:08,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/2) ... [2019-01-07 21:29:08,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dffe48b and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:29:08, skipping insertion in model container [2019-01-07 21:29:08,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:29:08" (2/2) ... [2019-01-07 21:29:08,950 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-07 21:29:08,961 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:29:08,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 21:29:08,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 21:29:09,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:29:09,029 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:29:09,029 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:29:09,029 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:29:09,029 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:29:09,030 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:29:09,030 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:29:09,031 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:29:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-07 21:29:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:29:09,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:09,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:29:09,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:09,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-07 21:29:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:09,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:09,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:09,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 21:29:09,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:09,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:29:09,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:29:09,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:29:09,348 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-07 21:29:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:09,557 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-07 21:29:09,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:29:09,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-07 21:29:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:09,571 INFO L225 Difference]: With dead ends: 26 [2019-01-07 21:29:09,571 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 21:29:09,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-07 21:29:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 21:29:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-07 21:29:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 21:29:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-07 21:29:09,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-07 21:29:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:09,613 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-07 21:29:09,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:29:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-07 21:29:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:29:09,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:09,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:29:09,615 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-07 21:29:09,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:09,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:09,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:10,040 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-07 21:29:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:10,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:10,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-07 21:29:10,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:10,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:29:10,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:29:10,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:29:10,047 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-07 21:29:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:10,135 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-07 21:29:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:29:10,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-07 21:29:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:10,137 INFO L225 Difference]: With dead ends: 25 [2019-01-07 21:29:10,137 INFO L226 Difference]: Without dead ends: 23 [2019-01-07 21:29:10,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-07 21:29:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-07 21:29:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-07 21:29:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-07 21:29:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-07 21:29:10,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-07 21:29:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:10,145 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-07 21:29:10,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:29:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-07 21:29:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:29:10,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:10,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:29:10,147 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:10,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:10,147 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-07 21:29:10,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:10,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:10,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:10,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:10,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:29:10,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:10,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 21:29:10,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:10,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:29:10,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:29:10,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:29:10,194 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-07 21:29:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:10,235 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-07 21:29:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:29:10,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-07 21:29:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:10,238 INFO L225 Difference]: With dead ends: 24 [2019-01-07 21:29:10,238 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 21:29:10,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:29:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 21:29:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-07 21:29:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 21:29:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-07 21:29:10,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-07 21:29:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:10,243 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-07 21:29:10,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:29:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-07 21:29:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:29:10,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:10,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:29:10,245 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-07 21:29:10,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:10,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:10,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:10,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:10,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:10,606 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-07 21:29:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:10,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:10,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:10,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:29:10,700 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-07 21:29:10,753 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:29:10,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:29:10,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:29:10,889 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:29:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:10,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:29:10,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:10,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:10,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:10,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:10,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:11,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:11,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:11,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-07 21:29:11,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:11,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:29:11,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:29:11,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:29:11,148 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-07 21:29:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:11,414 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-07 21:29:11,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:29:11,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-07 21:29:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:11,416 INFO L225 Difference]: With dead ends: 26 [2019-01-07 21:29:11,416 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 21:29:11,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:29:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 21:29:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-07 21:29:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-07 21:29:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-07 21:29:11,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-07 21:29:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:11,422 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-07 21:29:11,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:29:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-07 21:29:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-07 21:29:11,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:11,423 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:29:11,423 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-07 21:29:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:11,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:11,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:11,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:11,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:11,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-07 21:29:11,499 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-07 21:29:11,502 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:29:11,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:29:11,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:29:11,564 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2019-01-07 21:29:11,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:11,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:29:11,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:11,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:11,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:11,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:11,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:11,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:11,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:11,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-07 21:29:11,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:11,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:29:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:29:11,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:29:11,765 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-07 21:29:12,130 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-07 21:29:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:12,216 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-07 21:29:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:29:12,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-07 21:29:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:12,218 INFO L225 Difference]: With dead ends: 31 [2019-01-07 21:29:12,218 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 21:29:12,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:29:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 21:29:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-07 21:29:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 21:29:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-07 21:29:12,227 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-07 21:29:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:12,227 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-07 21:29:12,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:29:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-07 21:29:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-07 21:29:12,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:12,228 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:29:12,229 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-07 21:29:12,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:12,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:12,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:12,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:12,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:12,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:12,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:12,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:12,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:12,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:12,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:12,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:12,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:29:12,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:12,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:12,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:12,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:12,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-07 21:29:12,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:12,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:29:12,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:29:12,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:29:12,783 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-07 21:29:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:13,097 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-07 21:29:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:29:13,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-07 21:29:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:13,100 INFO L225 Difference]: With dead ends: 35 [2019-01-07 21:29:13,100 INFO L226 Difference]: Without dead ends: 28 [2019-01-07 21:29:13,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:29:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-07 21:29:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-07 21:29:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 21:29:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-07 21:29:13,107 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-07 21:29:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:13,107 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-07 21:29:13,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:29:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-07 21:29:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-07 21:29:13,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:13,109 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-07 21:29:13,109 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-07 21:29:13,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:13,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:13,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:13,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:13,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:13,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:13,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:13,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:13,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:13,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:13,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:13,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:13,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:13,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:13,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:13,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-07 21:29:13,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:13,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:29:13,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:29:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:29:13,408 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-07 21:29:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:13,519 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-07 21:29:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:29:13,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-07 21:29:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:13,522 INFO L225 Difference]: With dead ends: 45 [2019-01-07 21:29:13,522 INFO L226 Difference]: Without dead ends: 26 [2019-01-07 21:29:13,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:29:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-07 21:29:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-07 21:29:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-07 21:29:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-07 21:29:13,529 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-07 21:29:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:13,530 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-07 21:29:13,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:29:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-07 21:29:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-07 21:29:13,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:13,531 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-07 21:29:13,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:13,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-07 21:29:13,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:13,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:13,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:13,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:13,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:13,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:13,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:13,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:13,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:13,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:13,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:13,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:14,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-07 21:29:14,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:14,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:29:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:29:14,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:29:14,167 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-07 21:29:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:14,594 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-07 21:29:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-07 21:29:14,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-07 21:29:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:14,597 INFO L225 Difference]: With dead ends: 49 [2019-01-07 21:29:14,597 INFO L226 Difference]: Without dead ends: 39 [2019-01-07 21:29:14,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:29:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-07 21:29:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-07 21:29:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-07 21:29:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-07 21:29:14,678 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-07 21:29:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:14,678 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-07 21:29:14,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:29:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-07 21:29:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-07 21:29:14,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:14,679 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-07 21:29:14,680 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:14,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-07 21:29:14,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:14,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:14,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:14,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:14,790 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:14,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:14,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:14,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:14,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:14,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:14,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:29:14,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:14,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:15,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:15,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-07 21:29:15,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:15,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:29:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:29:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:29:15,038 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-07 21:29:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:15,262 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-07 21:29:15,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:29:15,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-07 21:29:15,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:15,263 INFO L225 Difference]: With dead ends: 60 [2019-01-07 21:29:15,264 INFO L226 Difference]: Without dead ends: 33 [2019-01-07 21:29:15,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:29:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-07 21:29:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-07 21:29:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 21:29:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-07 21:29:15,270 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-07 21:29:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:15,271 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-07 21:29:15,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:29:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-07 21:29:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-07 21:29:15,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:15,272 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-07 21:29:15,272 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-07 21:29:15,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:15,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:15,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:15,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:15,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:15,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:15,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:15,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:15,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:15,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:15,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:15,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:15,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:15,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:15,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:15,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:15,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:15,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-07 21:29:15,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:15,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-07 21:29:15,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-07 21:29:15,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:29:15,820 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-07 21:29:16,677 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-07 21:29:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:16,921 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-07 21:29:16,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-07 21:29:16,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-07 21:29:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:16,925 INFO L225 Difference]: With dead ends: 64 [2019-01-07 21:29:16,925 INFO L226 Difference]: Without dead ends: 50 [2019-01-07 21:29:16,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-01-07 21:29:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-07 21:29:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-07 21:29:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 21:29:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-07 21:29:16,932 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-07 21:29:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:16,933 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-07 21:29:16,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-07 21:29:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-07 21:29:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-07 21:29:16,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:16,934 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-07 21:29:16,935 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-07 21:29:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:16,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:16,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:17,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:17,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:17,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:17,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:17,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:17,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:17,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:17,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:17,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:17,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:17,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:17,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-07 21:29:17,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:17,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-07 21:29:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-07 21:29:17,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:29:17,807 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-07 21:29:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:18,170 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-07 21:29:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 21:29:18,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-07 21:29:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:18,172 INFO L225 Difference]: With dead ends: 75 [2019-01-07 21:29:18,172 INFO L226 Difference]: Without dead ends: 40 [2019-01-07 21:29:18,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:29:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-07 21:29:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-07 21:29:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-07 21:29:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-07 21:29:18,179 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-07 21:29:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:18,179 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-07 21:29:18,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-07 21:29:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-07 21:29:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-07 21:29:18,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:18,180 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-07 21:29:18,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-07 21:29:18,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:18,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:18,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:18,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:18,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:18,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:18,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:18,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:18,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:18,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:18,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:18,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-07 21:29:18,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:18,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:19,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:20,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:20,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-07 21:29:20,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:20,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-07 21:29:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-07 21:29:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 21:29:20,080 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-07 21:29:22,675 WARN L181 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-07 21:29:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:23,063 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-07 21:29:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-07 21:29:23,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-07 21:29:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:23,064 INFO L225 Difference]: With dead ends: 97 [2019-01-07 21:29:23,064 INFO L226 Difference]: Without dead ends: 58 [2019-01-07 21:29:23,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-01-07 21:29:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-07 21:29:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-07 21:29:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-07 21:29:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-07 21:29:23,074 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-07 21:29:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:23,074 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-07 21:29:23,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-07 21:29:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-07 21:29:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-07 21:29:23,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:23,075 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-07 21:29:23,076 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:23,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-07 21:29:23,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:23,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:23,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:23,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:23,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:23,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:23,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:23,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:23,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:23,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:23,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:23,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:23,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:23,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:23,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:23,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:23,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:23,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:23,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-07 21:29:23,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:23,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-07 21:29:23,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-07 21:29:23,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:29:23,915 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-07 21:29:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:25,321 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-07 21:29:25,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-07 21:29:25,321 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-07 21:29:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:25,323 INFO L225 Difference]: With dead ends: 94 [2019-01-07 21:29:25,323 INFO L226 Difference]: Without dead ends: 72 [2019-01-07 21:29:25,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-07 21:29:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-07 21:29:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-07 21:29:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-07 21:29:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-07 21:29:25,333 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-07 21:29:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:25,334 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-07 21:29:25,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-07 21:29:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-07 21:29:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-07 21:29:25,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:25,335 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-07 21:29:25,335 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:25,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-07 21:29:25,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:25,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:25,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:25,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:25,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:25,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:25,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:25,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:25,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:25,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:25,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:25,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:25,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:25,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:25,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:25,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-07 21:29:25,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:25,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-07 21:29:25,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-07 21:29:25,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:29:25,831 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-07 21:29:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:26,091 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-07 21:29:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-07 21:29:26,092 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-07 21:29:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:26,093 INFO L225 Difference]: With dead ends: 105 [2019-01-07 21:29:26,093 INFO L226 Difference]: Without dead ends: 54 [2019-01-07 21:29:26,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-01-07 21:29:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-07 21:29:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-07 21:29:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-07 21:29:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-07 21:29:26,104 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-07 21:29:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:26,104 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-07 21:29:26,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-07 21:29:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-07 21:29:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-07 21:29:26,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:26,105 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-07 21:29:26,105 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:26,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:26,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-07 21:29:26,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:26,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:26,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:26,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:26,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:26,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:26,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:26,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:26,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:26,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:26,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:26,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:26,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:26,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-07 21:29:26,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:26,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:26,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:26,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:26,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-07 21:29:26,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:26,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-07 21:29:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-07 21:29:26,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-07 21:29:26,991 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-07 21:29:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:28,094 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-07 21:29:28,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-07 21:29:28,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-07 21:29:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:28,103 INFO L225 Difference]: With dead ends: 109 [2019-01-07 21:29:28,103 INFO L226 Difference]: Without dead ends: 83 [2019-01-07 21:29:28,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-07 21:29:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-07 21:29:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-07 21:29:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-07 21:29:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-07 21:29:28,115 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-07 21:29:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:28,115 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-07 21:29:28,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-07 21:29:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-07 21:29:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-07 21:29:28,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:28,116 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-07 21:29:28,117 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:28,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-07 21:29:28,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:28,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:28,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:28,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:28,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:28,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:28,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:28,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:28,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:28,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:28,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:28,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:28,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:28,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:28,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:28,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:28,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:28,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:28,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-07 21:29:28,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:28,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-07 21:29:28,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-07 21:29:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-07 21:29:28,793 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-07 21:29:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:29,272 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-07 21:29:29,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-07 21:29:29,272 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-07 21:29:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:29,274 INFO L225 Difference]: With dead ends: 120 [2019-01-07 21:29:29,274 INFO L226 Difference]: Without dead ends: 61 [2019-01-07 21:29:29,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 21:29:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-07 21:29:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-07 21:29:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-07 21:29:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-07 21:29:29,286 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-07 21:29:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:29,286 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-07 21:29:29,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-07 21:29:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-07 21:29:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-07 21:29:29,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:29,287 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-07 21:29:29,288 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:29,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-07 21:29:29,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:29,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:29,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:29,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:29,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:29,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:29,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:29,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:29,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:29,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:29,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:29,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:29,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:29,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:30,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:30,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:30,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-07 21:29:30,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:30,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-07 21:29:30,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-07 21:29:30,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-07 21:29:30,293 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-07 21:29:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:31,792 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-07 21:29:31,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-07 21:29:31,793 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-07 21:29:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:31,797 INFO L225 Difference]: With dead ends: 124 [2019-01-07 21:29:31,797 INFO L226 Difference]: Without dead ends: 94 [2019-01-07 21:29:31,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-07 21:29:31,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-07 21:29:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-07 21:29:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-07 21:29:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-07 21:29:31,813 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-07 21:29:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:31,813 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-07 21:29:31,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-07 21:29:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-07 21:29:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-07 21:29:31,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:31,814 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-07 21:29:31,816 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:31,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-07 21:29:31,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:31,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:31,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:32,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:32,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:32,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:32,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:32,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:32,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:32,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:32,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:32,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-07 21:29:32,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:32,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:32,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:32,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-07 21:29:32,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:32,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-07 21:29:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-07 21:29:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-07 21:29:32,484 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-07 21:29:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:33,026 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-07 21:29:33,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-07 21:29:33,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-07 21:29:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:33,027 INFO L225 Difference]: With dead ends: 135 [2019-01-07 21:29:33,027 INFO L226 Difference]: Without dead ends: 68 [2019-01-07 21:29:33,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:29:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-07 21:29:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-07 21:29:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-07 21:29:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-07 21:29:33,047 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-07 21:29:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:33,047 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-07 21:29:33,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-07 21:29:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-07 21:29:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-07 21:29:33,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:33,048 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-07 21:29:33,049 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:33,055 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-07 21:29:33,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:33,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:33,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:33,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:33,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:33,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:33,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:33,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:33,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:33,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:33,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:33,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:33,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:33,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:33,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:33,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:33,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:34,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:34,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-07 21:29:34,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:34,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-07 21:29:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-07 21:29:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-07 21:29:34,005 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-07 21:29:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:36,104 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-07 21:29:36,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-07 21:29:36,104 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-07 21:29:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:36,105 INFO L225 Difference]: With dead ends: 139 [2019-01-07 21:29:36,106 INFO L226 Difference]: Without dead ends: 105 [2019-01-07 21:29:36,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:29:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-07 21:29:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-07 21:29:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-07 21:29:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-07 21:29:36,116 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-07 21:29:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:36,116 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-07 21:29:36,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-07 21:29:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-07 21:29:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-07 21:29:36,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:36,117 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-07 21:29:36,118 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-07 21:29:36,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:36,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:36,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:36,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:36,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:36,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:36,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:36,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:36,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:36,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:36,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:36,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:36,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:36,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:37,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:37,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:37,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-07 21:29:37,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:37,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-07 21:29:37,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-07 21:29:37,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-07 21:29:37,250 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-07 21:29:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:37,631 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-07 21:29:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-07 21:29:37,632 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-07 21:29:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:37,633 INFO L225 Difference]: With dead ends: 150 [2019-01-07 21:29:37,633 INFO L226 Difference]: Without dead ends: 75 [2019-01-07 21:29:37,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-07 21:29:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-07 21:29:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-07 21:29:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-07 21:29:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-07 21:29:37,644 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-07 21:29:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:37,644 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-07 21:29:37,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-07 21:29:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-07 21:29:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-07 21:29:37,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:37,647 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-07 21:29:37,647 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-07 21:29:37,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:37,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:37,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:37,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:37,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:38,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:38,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:38,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:38,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:38,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:38,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:38,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:38,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:38,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-07 21:29:38,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:38,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:39,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:40,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:40,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-07 21:29:40,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:40,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-07 21:29:40,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-07 21:29:40,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-07 21:29:40,037 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-07 21:29:42,645 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-07 21:29:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:44,706 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-07 21:29:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-07 21:29:44,706 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-07 21:29:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:44,708 INFO L225 Difference]: With dead ends: 192 [2019-01-07 21:29:44,708 INFO L226 Difference]: Without dead ends: 113 [2019-01-07 21:29:44,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-07 21:29:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-07 21:29:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-07 21:29:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-07 21:29:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-07 21:29:44,720 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-07 21:29:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:44,720 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-07 21:29:44,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-07 21:29:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-07 21:29:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-07 21:29:44,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:44,721 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-07 21:29:44,721 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-07 21:29:44,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:44,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:44,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:46,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:46,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:46,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:46,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:46,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:46,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:46,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:46,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:46,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:46,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:46,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:46,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:46,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:46,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-07 21:29:46,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:46,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-07 21:29:46,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-07 21:29:46,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:29:46,690 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-07 21:29:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:48,880 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-07 21:29:48,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-07 21:29:48,883 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-07 21:29:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:48,884 INFO L225 Difference]: With dead ends: 169 [2019-01-07 21:29:48,884 INFO L226 Difference]: Without dead ends: 127 [2019-01-07 21:29:48,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-07 21:29:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-07 21:29:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-07 21:29:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-07 21:29:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-07 21:29:48,896 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-07 21:29:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:48,896 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-07 21:29:48,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-07 21:29:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-07 21:29:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-07 21:29:48,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:48,898 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-07 21:29:48,898 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-07 21:29:48,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:48,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:48,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:49,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:49,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:49,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:49,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:49,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:49,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:49,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:49,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:49,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:49,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-07 21:29:50,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-07 21:29:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-07 21:29:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:29:50,083 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-07 21:29:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:50,600 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-07 21:29:50,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-07 21:29:50,600 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-07 21:29:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:50,601 INFO L225 Difference]: With dead ends: 180 [2019-01-07 21:29:50,602 INFO L226 Difference]: Without dead ends: 89 [2019-01-07 21:29:50,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:29:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-07 21:29:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-07 21:29:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-07 21:29:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-07 21:29:50,614 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-07 21:29:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:50,614 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-07 21:29:50,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-07 21:29:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-07 21:29:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-07 21:29:50,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:50,615 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-07 21:29:50,615 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-07 21:29:50,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:50,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:50,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:50,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:50,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:51,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:51,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:51,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:51,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:51,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:51,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:51,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:51,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:51,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-07 21:29:51,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:51,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:52,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:53,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:53,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-07 21:29:53,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:53,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-07 21:29:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-07 21:29:53,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-07 21:29:53,285 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-07 21:29:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:59,692 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-07 21:29:59,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-07 21:29:59,692 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-07 21:29:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:59,693 INFO L225 Difference]: With dead ends: 230 [2019-01-07 21:29:59,693 INFO L226 Difference]: Without dead ends: 135 [2019-01-07 21:29:59,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-07 21:29:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-07 21:29:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-07 21:29:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-07 21:29:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-07 21:29:59,709 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-07 21:29:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:59,709 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-07 21:29:59,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-07 21:29:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-07 21:29:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-07 21:29:59,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:59,710 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-07 21:29:59,710 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-07 21:29:59,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:59,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:59,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:59,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:00,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:00,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:00,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:00,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:00,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:00,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:00,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:00,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:00,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:00,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:00,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:01,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:01,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:01,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-07 21:30:01,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:01,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-07 21:30:01,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-07 21:30:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 21:30:01,171 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-07 21:30:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:04,231 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-07 21:30:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-07 21:30:04,232 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-07 21:30:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:04,233 INFO L225 Difference]: With dead ends: 199 [2019-01-07 21:30:04,233 INFO L226 Difference]: Without dead ends: 149 [2019-01-07 21:30:04,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 21:30:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-07 21:30:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-07 21:30:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-07 21:30:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-07 21:30:04,249 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-07 21:30:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:04,249 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-07 21:30:04,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-07 21:30:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-07 21:30:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-07 21:30:04,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:04,250 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-07 21:30:04,250 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-07 21:30:04,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:04,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:04,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:04,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:04,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:04,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:04,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:04,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:04,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:04,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:04,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:04,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:05,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:05,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:05,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-07 21:30:05,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:05,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-07 21:30:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-07 21:30:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 21:30:05,961 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-07 21:30:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:06,605 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-07 21:30:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-07 21:30:06,605 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-07 21:30:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:06,606 INFO L225 Difference]: With dead ends: 210 [2019-01-07 21:30:06,606 INFO L226 Difference]: Without dead ends: 103 [2019-01-07 21:30:06,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-01-07 21:30:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-07 21:30:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-07 21:30:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-07 21:30:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-07 21:30:06,625 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-07 21:30:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:06,625 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-07 21:30:06,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-07 21:30:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-07 21:30:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-07 21:30:06,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:06,625 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-07 21:30:06,626 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-07 21:30:06,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:06,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:06,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:07,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:07,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:07,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:07,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:07,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:07,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:07,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:07,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:07,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-07 21:30:07,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:07,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:08,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:08,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:08,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-07 21:30:08,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:08,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-07 21:30:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-07 21:30:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-07 21:30:08,385 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-07 21:30:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:12,043 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-07 21:30:12,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-07 21:30:12,043 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-07 21:30:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:12,044 INFO L225 Difference]: With dead ends: 214 [2019-01-07 21:30:12,045 INFO L226 Difference]: Without dead ends: 160 [2019-01-07 21:30:12,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-07 21:30:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-07 21:30:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-07 21:30:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-07 21:30:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-07 21:30:12,063 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-07 21:30:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:12,064 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-07 21:30:12,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-07 21:30:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-07 21:30:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-07 21:30:12,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:12,064 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-07 21:30:12,064 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-07 21:30:12,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:12,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:12,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:12,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:12,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:12,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:12,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:12,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:12,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:12,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:12,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:12,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:12,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:12,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:12,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:12,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:13,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-07 21:30:13,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-07 21:30:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-07 21:30:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-07 21:30:13,255 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-07 21:30:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:13,863 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-07 21:30:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-07 21:30:13,867 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-07 21:30:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:13,868 INFO L225 Difference]: With dead ends: 225 [2019-01-07 21:30:13,868 INFO L226 Difference]: Without dead ends: 110 [2019-01-07 21:30:13,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 21:30:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-07 21:30:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-07 21:30:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-07 21:30:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-07 21:30:13,888 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-07 21:30:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:13,888 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-07 21:30:13,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-07 21:30:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-07 21:30:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-07 21:30:13,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:13,889 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-07 21:30:13,889 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-07 21:30:13,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:13,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:13,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:13,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:13,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:14,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:14,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:14,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:14,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:14,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:14,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:14,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:14,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:14,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:15,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:15,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:15,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-07 21:30:15,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:15,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-07 21:30:15,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-07 21:30:15,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:30:15,831 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-07 21:30:20,443 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-07 21:30:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:20,794 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-07 21:30:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-07 21:30:20,795 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-07 21:30:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:20,796 INFO L225 Difference]: With dead ends: 229 [2019-01-07 21:30:20,796 INFO L226 Difference]: Without dead ends: 171 [2019-01-07 21:30:20,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:30:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-07 21:30:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-07 21:30:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-07 21:30:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-07 21:30:20,818 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-07 21:30:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:20,819 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-07 21:30:20,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-07 21:30:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-07 21:30:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-07 21:30:20,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:20,820 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-07 21:30:20,820 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-07 21:30:20,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:20,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:21,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:21,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:21,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:21,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:21,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:21,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:21,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:21,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:21,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-07 21:30:21,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:21,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:21,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:22,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:22,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-07 21:30:22,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:22,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-07 21:30:22,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-07 21:30:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:30:22,067 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-07 21:30:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:22,601 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-07 21:30:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-07 21:30:22,601 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-07 21:30:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:22,603 INFO L225 Difference]: With dead ends: 240 [2019-01-07 21:30:22,603 INFO L226 Difference]: Without dead ends: 117 [2019-01-07 21:30:22,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-01-07 21:30:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-07 21:30:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-07 21:30:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-07 21:30:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-07 21:30:22,624 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-07 21:30:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:22,624 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-07 21:30:22,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-07 21:30:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-07 21:30:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-07 21:30:22,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:22,625 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-07 21:30:22,625 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-07 21:30:22,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:22,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:22,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:23,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:23,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:23,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:23,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:23,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:23,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:23,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:23,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:23,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:23,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:24,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:24,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:24,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-07 21:30:24,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:24,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-07 21:30:24,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-07 21:30:24,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-07 21:30:24,458 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-07 21:30:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:29,597 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-07 21:30:29,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-07 21:30:29,601 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-07 21:30:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:29,602 INFO L225 Difference]: With dead ends: 244 [2019-01-07 21:30:29,602 INFO L226 Difference]: Without dead ends: 182 [2019-01-07 21:30:29,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-07 21:30:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-07 21:30:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-07 21:30:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-07 21:30:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-07 21:30:29,627 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-07 21:30:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:29,627 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-07 21:30:29,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-07 21:30:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-07 21:30:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-07 21:30:29,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:29,628 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-07 21:30:29,629 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:29,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:29,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-07 21:30:29,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:29,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:29,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:30,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:30,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:30,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:30,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:30,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:30,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:30,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:30,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:30,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:31,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:31,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:31,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-07 21:30:31,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:31,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-07 21:30:31,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-07 21:30:31,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-07 21:30:31,415 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-07 21:30:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:32,320 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-07 21:30:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-07 21:30:32,320 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-07 21:30:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:32,322 INFO L225 Difference]: With dead ends: 255 [2019-01-07 21:30:32,322 INFO L226 Difference]: Without dead ends: 124 [2019-01-07 21:30:32,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 21:30:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-07 21:30:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-07 21:30:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-07 21:30:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-07 21:30:32,341 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-07 21:30:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:32,341 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-07 21:30:32,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-07 21:30:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-07 21:30:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-07 21:30:32,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:32,342 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-07 21:30:32,342 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-07 21:30:32,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:32,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:32,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:33,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:33,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:33,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:33,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:33,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:33,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:33,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:33,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:33,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-07 21:30:33,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:33,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:35,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:37,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:37,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-07 21:30:37,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:37,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-07 21:30:37,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-07 21:30:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-07 21:30:37,551 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-07 21:30:45,966 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-07 21:30:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:47,929 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-07 21:30:47,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-07 21:30:47,929 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-07 21:30:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:47,931 INFO L225 Difference]: With dead ends: 325 [2019-01-07 21:30:47,931 INFO L226 Difference]: Without dead ends: 190 [2019-01-07 21:30:47,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-07 21:30:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-07 21:30:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-07 21:30:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-07 21:30:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-07 21:30:47,954 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-07 21:30:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:47,954 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-07 21:30:47,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-07 21:30:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-07 21:30:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-07 21:30:47,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:47,955 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-07 21:30:47,955 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:47,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:47,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-07 21:30:47,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:47,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:47,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:47,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:48,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:48,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:48,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:48,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:48,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:48,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:48,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:48,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:49,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:49,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:49,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:49,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:50,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:50,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-07 21:30:50,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:50,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-07 21:30:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-07 21:30:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-07 21:30:50,042 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-07 21:30:53,811 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-07 21:30:54,080 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-07 21:30:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:55,857 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-07 21:30:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-07 21:30:55,857 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-07 21:30:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:55,859 INFO L225 Difference]: With dead ends: 274 [2019-01-07 21:30:55,859 INFO L226 Difference]: Without dead ends: 204 [2019-01-07 21:30:55,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-07 21:30:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-07 21:30:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-07 21:30:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-07 21:30:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-07 21:30:55,885 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-07 21:30:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:55,886 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-07 21:30:55,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-07 21:30:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-07 21:30:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-07 21:30:55,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:55,886 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-07 21:30:55,886 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-07 21:30:55,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:55,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:55,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:57,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:57,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:57,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:57,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:57,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:57,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:57,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:57,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:57,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:57,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:58,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:58,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-07 21:30:58,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:58,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-07 21:30:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-07 21:30:58,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-07 21:30:58,438 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-07 21:30:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:59,337 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-07 21:30:59,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-07 21:30:59,337 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-07 21:30:59,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:59,338 INFO L225 Difference]: With dead ends: 285 [2019-01-07 21:30:59,338 INFO L226 Difference]: Without dead ends: 138 [2019-01-07 21:30:59,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 21:30:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-07 21:30:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-07 21:30:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-07 21:30:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-07 21:30:59,367 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-07 21:30:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:59,367 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-07 21:30:59,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-07 21:30:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-07 21:30:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-07 21:30:59,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:59,368 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-07 21:30:59,368 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-07 21:30:59,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:59,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:59,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:00,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:00,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:00,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:00,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:00,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:00,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:31:00,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:31:00,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:31:00,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-07 21:31:00,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:00,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:03,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:05,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:05,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-07 21:31:05,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:05,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-07 21:31:05,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-07 21:31:05,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-07 21:31:05,836 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-07 21:31:17,079 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-07 21:31:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:19,968 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-07 21:31:19,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-07 21:31:19,968 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-07 21:31:19,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:19,970 INFO L225 Difference]: With dead ends: 363 [2019-01-07 21:31:19,970 INFO L226 Difference]: Without dead ends: 212 [2019-01-07 21:31:19,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-07 21:31:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-07 21:31:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-07 21:31:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-07 21:31:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-07 21:31:19,996 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-07 21:31:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:19,997 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-07 21:31:19,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-07 21:31:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-07 21:31:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-07 21:31:19,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:19,998 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-07 21:31:19,998 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:31:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-07 21:31:19,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:19,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:19,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:19,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:19,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:21,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:21,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:21,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:21,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:21,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:21,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:31:21,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:31:21,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:31:21,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:31:21,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:21,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:23,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:23,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:23,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-07 21:31:23,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:23,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-07 21:31:23,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-07 21:31:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-07 21:31:23,802 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-07 21:31:28,197 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-07 21:31:28,469 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-07 21:31:28,726 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-07 21:31:29,082 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-07 21:31:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:30,623 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-07 21:31:30,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-07 21:31:30,624 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-07 21:31:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:30,625 INFO L225 Difference]: With dead ends: 304 [2019-01-07 21:31:30,625 INFO L226 Difference]: Without dead ends: 226 [2019-01-07 21:31:30,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-07 21:31:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-07 21:31:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-07 21:31:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-07 21:31:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-07 21:31:30,653 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-07 21:31:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:30,653 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-07 21:31:30,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-07 21:31:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-07 21:31:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-07 21:31:30,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:30,654 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-07 21:31:30,654 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:31:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-07 21:31:30,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:30,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:30,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:30,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:30,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:31,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:31,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:31,493 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:31,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:31,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:31,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:31:31,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:31,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:31:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:31,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:32,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:33,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:33,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-07 21:31:33,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:33,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-07 21:31:33,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-07 21:31:33,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-07 21:31:33,181 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-07 21:31:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:34,501 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-07 21:31:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-07 21:31:34,502 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-07 21:31:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:34,504 INFO L225 Difference]: With dead ends: 315 [2019-01-07 21:31:34,504 INFO L226 Difference]: Without dead ends: 152 [2019-01-07 21:31:34,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:31:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-07 21:31:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-07 21:31:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-07 21:31:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-07 21:31:34,542 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-07 21:31:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:34,543 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-07 21:31:34,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-07 21:31:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-07 21:31:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-07 21:31:34,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:34,544 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-07 21:31:34,544 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:31:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:34,544 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-07 21:31:34,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:34,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:34,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:36,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:36,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:36,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:36,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:36,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:36,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:31:36,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:31:36,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:31:36,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-07 21:31:36,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:36,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:39,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:42,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:42,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-07 21:31:42,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:42,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-07 21:31:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-07 21:31:42,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-07 21:31:42,095 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-07 21:31:54,126 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-07 21:31:54,441 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-07 21:31:54,753 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-07 21:31:55,032 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:31:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:57,904 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-07 21:31:57,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-07 21:31:57,904 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-07 21:31:57,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:57,906 INFO L225 Difference]: With dead ends: 401 [2019-01-07 21:31:57,906 INFO L226 Difference]: Without dead ends: 234 [2019-01-07 21:31:57,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-07 21:31:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-07 21:31:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-07 21:31:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-07 21:31:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-07 21:31:57,941 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-07 21:31:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:57,941 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-07 21:31:57,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-07 21:31:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-07 21:31:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-07 21:31:57,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:57,943 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-07 21:31:57,943 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:31:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-07 21:31:57,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:57,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:57,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:57,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:57,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:00,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:00,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:00,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:00,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:00,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:00,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:32:00,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:32:00,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:32:00,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:32:00,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:00,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:01,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:01,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:01,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-07 21:32:01,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:01,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-07 21:32:01,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-07 21:32:01,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-07 21:32:01,747 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-07 21:32:07,544 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-07 21:32:07,913 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-07 21:32:08,262 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-07 21:32:08,460 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:32:08,648 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:32:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:10,671 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-07 21:32:10,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-07 21:32:10,671 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-07 21:32:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:10,673 INFO L225 Difference]: With dead ends: 334 [2019-01-07 21:32:10,673 INFO L226 Difference]: Without dead ends: 248 [2019-01-07 21:32:10,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-07 21:32:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-07 21:32:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-07 21:32:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-07 21:32:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-07 21:32:10,711 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-07 21:32:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:10,711 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-07 21:32:10,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-07 21:32:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-07 21:32:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-07 21:32:10,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:10,712 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-07 21:32:10,713 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:32:10,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-07 21:32:10,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:10,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:10,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:11,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:11,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:11,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:11,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:11,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:11,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:32:11,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:11,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:32:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:11,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:12,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:13,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:13,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-07 21:32:13,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:13,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-07 21:32:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-07 21:32:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-07 21:32:13,728 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-07 21:32:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:15,339 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-07 21:32:15,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-07 21:32:15,342 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-07 21:32:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:15,343 INFO L225 Difference]: With dead ends: 345 [2019-01-07 21:32:15,343 INFO L226 Difference]: Without dead ends: 166 [2019-01-07 21:32:15,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-07 21:32:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-07 21:32:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-07 21:32:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-07 21:32:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-07 21:32:15,374 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-07 21:32:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:15,374 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-07 21:32:15,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-07 21:32:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-07 21:32:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-07 21:32:15,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:15,375 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-07 21:32:15,375 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:32:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-07 21:32:15,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:15,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:15,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:17,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:17,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:17,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:17,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:17,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:17,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:32:17,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:32:17,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:32:17,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-07 21:32:17,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:17,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:19,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:19,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:19,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-07 21:32:19,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:19,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-07 21:32:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-07 21:32:19,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:32:19,624 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-07 21:32:26,600 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-07 21:32:26,935 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-07 21:32:27,246 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-07 21:32:27,456 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:32:27,660 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:32:27,855 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:32:28,249 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-07 21:32:28,503 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-07 21:32:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:30,058 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-07 21:32:30,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-07 21:32:30,059 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-07 21:32:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:30,061 INFO L225 Difference]: With dead ends: 349 [2019-01-07 21:32:30,061 INFO L226 Difference]: Without dead ends: 259 [2019-01-07 21:32:30,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-07 21:32:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-07 21:32:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-07 21:32:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-07 21:32:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-07 21:32:30,096 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-07 21:32:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:30,096 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-07 21:32:30,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-07 21:32:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-07 21:32:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-07 21:32:30,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:30,097 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-07 21:32:30,097 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:32:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-07 21:32:30,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:30,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:30,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:30,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:30,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:32,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:32,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:32,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:32,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:32,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:32,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:32:32,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:32:32,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:32:32,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:32:32,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:32,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:33,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:34,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:34,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-07 21:32:34,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:34,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-07 21:32:34,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-07 21:32:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:32:34,126 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-07 21:32:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:35,878 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-07 21:32:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-07 21:32:35,879 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-07 21:32:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:35,880 INFO L225 Difference]: With dead ends: 360 [2019-01-07 21:32:35,880 INFO L226 Difference]: Without dead ends: 173 [2019-01-07 21:32:35,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 21:32:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-07 21:32:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-07 21:32:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-07 21:32:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-07 21:32:35,913 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-07 21:32:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:35,914 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-07 21:32:35,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-07 21:32:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-07 21:32:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-07 21:32:35,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:35,915 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-07 21:32:35,915 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:32:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-07 21:32:35,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:35,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:35,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:37,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:37,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:37,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:37,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:37,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:37,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:32:37,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:37,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:32:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:37,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:39,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:39,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:39,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-07 21:32:39,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:39,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-07 21:32:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-07 21:32:39,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-07 21:32:39,957 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-07 21:32:47,408 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-07 21:32:47,769 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-07 21:32:48,107 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-07 21:32:48,330 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:32:48,543 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:32:48,795 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:32:49,038 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:32:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:51,142 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-07 21:32:51,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-07 21:32:51,142 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-07 21:32:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:51,143 INFO L225 Difference]: With dead ends: 364 [2019-01-07 21:32:51,143 INFO L226 Difference]: Without dead ends: 270 [2019-01-07 21:32:51,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-07 21:32:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-07 21:32:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-07 21:32:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-07 21:32:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-07 21:32:51,187 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-07 21:32:51,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:51,187 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-07 21:32:51,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-07 21:32:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-07 21:32:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-07 21:32:51,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:51,188 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-07 21:32:51,188 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:32:51,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-07 21:32:51,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:51,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:51,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:51,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:51,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:52,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:52,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:52,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:52,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:52,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:52,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:32:52,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:32:52,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:32:52,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-07 21:32:52,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:52,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:54,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:54,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:54,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-07 21:32:54,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:54,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-07 21:32:54,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-07 21:32:54,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-07 21:32:54,970 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-07 21:32:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:56,820 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-07 21:32:56,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-07 21:32:56,821 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-07 21:32:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:56,822 INFO L225 Difference]: With dead ends: 375 [2019-01-07 21:32:56,822 INFO L226 Difference]: Without dead ends: 180 [2019-01-07 21:32:56,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-07 21:32:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-07 21:32:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-07 21:32:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-07 21:32:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-07 21:32:56,867 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-07 21:32:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:56,867 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-07 21:32:56,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-07 21:32:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-07 21:32:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-07 21:32:56,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:56,868 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-07 21:32:56,868 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:32:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-07 21:32:56,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:56,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:56,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:59,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:59,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:59,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:59,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:59,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:59,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:32:59,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:32:59,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:32:59,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:32:59,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:59,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:01,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:01,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:01,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-07 21:33:01,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:01,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-07 21:33:01,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-07 21:33:01,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:33:01,421 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-07 21:33:07,875 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-07 21:33:08,241 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-07 21:33:08,595 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-07 21:33:08,838 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:33:09,068 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:33:09,346 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:33:09,572 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:33:10,352 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-07 21:33:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:11,978 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-07 21:33:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-07 21:33:11,979 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-07 21:33:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:11,980 INFO L225 Difference]: With dead ends: 379 [2019-01-07 21:33:11,981 INFO L226 Difference]: Without dead ends: 281 [2019-01-07 21:33:11,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-07 21:33:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-07 21:33:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-07 21:33:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-07 21:33:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-07 21:33:12,018 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-07 21:33:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:12,019 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-07 21:33:12,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-07 21:33:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-07 21:33:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-07 21:33:12,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:12,020 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-07 21:33:12,020 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-07 21:33:12,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:12,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:12,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:12,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:12,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:12,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:12,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:12,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:12,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:33:12,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:12,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:13,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:14,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:15,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:15,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-07 21:33:15,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:15,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-07 21:33:15,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-07 21:33:15,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:33:15,313 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-07 21:33:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:17,241 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-07 21:33:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-07 21:33:17,242 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-07 21:33:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:17,243 INFO L225 Difference]: With dead ends: 390 [2019-01-07 21:33:17,243 INFO L226 Difference]: Without dead ends: 187 [2019-01-07 21:33:17,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-01-07 21:33:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-07 21:33:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-07 21:33:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-07 21:33:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-07 21:33:17,298 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-07 21:33:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:17,298 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-07 21:33:17,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-07 21:33:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-07 21:33:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-07 21:33:17,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:17,300 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-07 21:33:17,300 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-07 21:33:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:17,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:19,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:19,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:19,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:19,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:19,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:19,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:33:19,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:33:19,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:33:19,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-07 21:33:19,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:19,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:23,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:27,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:27,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:27,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-07 21:33:27,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:27,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-07 21:33:27,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-07 21:33:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-07 21:33:27,841 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-07 21:33:45,779 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-07 21:33:46,225 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-07 21:33:46,691 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-07 21:33:47,077 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:33:47,447 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:33:47,802 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:33:48,142 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:33:48,462 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:33:48,765 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:33:50,170 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-07 21:33:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:52,043 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-07 21:33:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-07 21:33:52,043 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-07 21:33:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:52,045 INFO L225 Difference]: With dead ends: 496 [2019-01-07 21:33:52,045 INFO L226 Difference]: Without dead ends: 289 [2019-01-07 21:33:52,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-07 21:33:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-07 21:33:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-07 21:33:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-07 21:33:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-07 21:33:52,090 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-07 21:33:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:52,090 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-07 21:33:52,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-07 21:33:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-07 21:33:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-07 21:33:52,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:52,091 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-07 21:33:52,091 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:33:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:52,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-07 21:33:52,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:52,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:52,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:52,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:52,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:54,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:54,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:54,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:54,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:54,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:54,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:33:54,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:33:54,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:33:54,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:33:54,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:54,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:56,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:56,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:56,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-07 21:33:56,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:56,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-07 21:33:56,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-07 21:33:56,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:33:56,557 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-07 21:34:04,927 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-07 21:34:05,336 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-07 21:34:05,827 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-07 21:34:06,099 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:34:06,373 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:34:06,624 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:34:06,870 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:34:07,108 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:34:07,347 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:34:07,561 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:34:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:09,855 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-07 21:34:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-07 21:34:09,855 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-07 21:34:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:09,856 INFO L225 Difference]: With dead ends: 409 [2019-01-07 21:34:09,856 INFO L226 Difference]: Without dead ends: 303 [2019-01-07 21:34:09,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-07 21:34:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-07 21:34:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-07 21:34:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-07 21:34:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-07 21:34:09,900 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-07 21:34:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:09,901 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-07 21:34:09,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-07 21:34:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-07 21:34:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-07 21:34:09,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:09,902 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-07 21:34:09,902 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:09,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-07 21:34:09,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:09,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:09,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:09,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:09,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:11,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:11,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:11,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:11,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:11,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:11,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:34:11,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:11,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:11,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:12,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:13,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:13,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-07 21:34:13,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:13,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-07 21:34:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-07 21:34:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:34:13,824 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-07 21:34:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:16,346 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-07 21:34:16,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-07 21:34:16,346 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-07 21:34:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:16,348 INFO L225 Difference]: With dead ends: 420 [2019-01-07 21:34:16,348 INFO L226 Difference]: Without dead ends: 201 [2019-01-07 21:34:16,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-07 21:34:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-07 21:34:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-07 21:34:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-07 21:34:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-07 21:34:16,392 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-07 21:34:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:16,392 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-07 21:34:16,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-07 21:34:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-07 21:34:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-07 21:34:16,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:16,393 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-07 21:34:16,393 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-07 21:34:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:16,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:18,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:18,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:18,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:18,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:18,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:18,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:34:18,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:18,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:18,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-07 21:34:18,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:18,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:20,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:20,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:20,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-07 21:34:20,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:20,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-07 21:34:20,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-07 21:34:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-07 21:34:20,636 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-07 21:34:29,194 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-07 21:34:29,614 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-07 21:34:30,028 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-07 21:34:30,314 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:34:30,594 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:34:30,861 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:34:31,171 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:34:31,459 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:34:31,710 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:34:31,945 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:34:32,185 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:34:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:34,551 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-07 21:34:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-07 21:34:34,551 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-07 21:34:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:34,553 INFO L225 Difference]: With dead ends: 424 [2019-01-07 21:34:34,553 INFO L226 Difference]: Without dead ends: 314 [2019-01-07 21:34:34,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-07 21:34:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-07 21:34:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-07 21:34:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-07 21:34:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-07 21:34:34,612 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-07 21:34:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:34,612 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-07 21:34:34,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-07 21:34:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-07 21:34:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-07 21:34:34,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:34,613 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-07 21:34:34,614 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-07 21:34:34,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:34,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:34,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:34,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:34,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:35,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:35,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:35,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:35,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:35,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:35,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:34:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:34:35,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:34:35,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:34:35,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:35,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:37,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:38,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:38,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-07 21:34:38,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:38,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-07 21:34:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-07 21:34:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-07 21:34:38,459 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-07 21:34:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:40,844 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-07 21:34:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-07 21:34:40,845 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-07 21:34:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:40,846 INFO L225 Difference]: With dead ends: 435 [2019-01-07 21:34:40,846 INFO L226 Difference]: Without dead ends: 208 [2019-01-07 21:34:40,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-07 21:34:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-07 21:34:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-07 21:34:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-07 21:34:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-07 21:34:40,902 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-07 21:34:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:40,902 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-07 21:34:40,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-07 21:34:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-07 21:34:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-07 21:34:40,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:40,903 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-07 21:34:40,903 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:34:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-07 21:34:40,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:40,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:40,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:43,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:43,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:43,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:43,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:43,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:43,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:34:43,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:43,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:43,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:45,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:45,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:45,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-07 21:34:45,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:45,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-07 21:34:45,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-07 21:34:45,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 21:34:45,720 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-07 21:34:54,868 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-07 21:34:55,316 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-07 21:34:55,740 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-07 21:34:56,039 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:34:56,330 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:34:56,618 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:34:56,971 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:34:57,242 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:34:57,505 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:34:57,766 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:34:58,006 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:34:58,242 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:35:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:00,727 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-07 21:35:00,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-07 21:35:00,727 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-07 21:35:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:00,729 INFO L225 Difference]: With dead ends: 439 [2019-01-07 21:35:00,730 INFO L226 Difference]: Without dead ends: 325 [2019-01-07 21:35:00,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-07 21:35:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-07 21:35:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-07 21:35:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-07 21:35:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-07 21:35:00,785 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-07 21:35:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:00,785 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-07 21:35:00,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-07 21:35:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-07 21:35:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-07 21:35:00,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:00,786 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-07 21:35:00,787 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:35:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-07 21:35:00,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:00,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:00,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:02,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:02,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:02,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:02,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:02,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:02,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:35:02,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:35:02,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:35:03,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-07 21:35:03,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:35:03,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:04,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:05,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:05,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-07 21:35:05,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:05,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-07 21:35:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-07 21:35:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 21:35:05,853 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-07 21:35:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:08,721 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-07 21:35:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-07 21:35:08,721 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-07 21:35:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:08,723 INFO L225 Difference]: With dead ends: 450 [2019-01-07 21:35:08,724 INFO L226 Difference]: Without dead ends: 215 [2019-01-07 21:35:08,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 21:35:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-07 21:35:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-07 21:35:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-07 21:35:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-07 21:35:08,779 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-07 21:35:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:08,779 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-07 21:35:08,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-07 21:35:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-07 21:35:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-07 21:35:08,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:08,781 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-07 21:35:08,781 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:35:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-07 21:35:08,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:08,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:08,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:35:08,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:08,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:10,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:10,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:10,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:10,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:10,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:10,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:35:10,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:35:10,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:35:10,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:35:10,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:35:10,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:13,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:14,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:14,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-07 21:35:14,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:14,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-07 21:35:14,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-07 21:35:14,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-07 21:35:14,112 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-07 21:35:24,405 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-07 21:35:24,884 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-07 21:35:25,340 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-07 21:35:25,671 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:35:25,980 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:35:26,278 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:35:26,570 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:35:26,858 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:35:27,135 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:35:27,432 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:35:27,725 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:35:27,981 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:35:28,219 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:35:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:30,773 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-07 21:35:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-07 21:35:30,773 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-07 21:35:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:30,775 INFO L225 Difference]: With dead ends: 454 [2019-01-07 21:35:30,775 INFO L226 Difference]: Without dead ends: 336 [2019-01-07 21:35:30,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-07 21:35:30,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-07 21:35:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-07 21:35:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-07 21:35:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-07 21:35:30,848 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-07 21:35:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:30,848 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-07 21:35:30,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-07 21:35:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-07 21:35:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-07 21:35:30,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:30,849 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-07 21:35:30,849 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:35:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-07 21:35:30,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:30,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:35:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:30,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:32,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:32,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:32,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:32,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:32,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:32,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:35:32,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:32,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:35:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:32,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:34,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:35,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:35,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-07 21:35:35,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:35,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-07 21:35:35,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-07 21:35:35,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-07 21:35:35,210 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-07 21:35:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:38,208 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-07 21:35:38,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-07 21:35:38,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-07 21:35:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:38,210 INFO L225 Difference]: With dead ends: 465 [2019-01-07 21:35:38,210 INFO L226 Difference]: Without dead ends: 222 [2019-01-07 21:35:38,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-07 21:35:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-07 21:35:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-07 21:35:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-07 21:35:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-07 21:35:38,264 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-07 21:35:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:38,264 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-07 21:35:38,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-07 21:35:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-07 21:35:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-07 21:35:38,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:38,265 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-07 21:35:38,266 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:35:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-07 21:35:38,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:38,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:38,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:38,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:38,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:40,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:40,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:40,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:40,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:40,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:40,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:35:40,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:35:40,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:35:40,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-07 21:35:40,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:35:40,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:46,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:52,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:52,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-07 21:35:52,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:52,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-07 21:35:52,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-07 21:35:52,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-07 21:35:52,498 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-07 21:36:16,930 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-07 21:36:17,521 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-07 21:36:18,109 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-07 21:36:18,647 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-07 21:36:19,178 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:36:19,663 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:36:20,116 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:36:20,563 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:36:21,004 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:36:21,434 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:36:21,841 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:36:22,236 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:36:22,611 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:36:22,968 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:36:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:26,675 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-07 21:36:26,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-07 21:36:26,675 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-07 21:36:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:26,676 INFO L225 Difference]: With dead ends: 591 [2019-01-07 21:36:26,677 INFO L226 Difference]: Without dead ends: 344 [2019-01-07 21:36:26,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-07 21:36:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-07 21:36:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-07 21:36:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-07 21:36:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-07 21:36:26,735 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-07 21:36:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:26,735 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-07 21:36:26,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-07 21:36:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-07 21:36:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-07 21:36:26,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:26,736 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-07 21:36:26,736 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:36:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-07 21:36:26,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:26,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:36:26,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:26,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:29,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:29,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:29,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:29,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:29,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:29,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:36:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:36:29,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:36:29,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:36:29,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:36:29,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:32,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:32,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:32,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-07 21:36:32,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:32,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-07 21:36:32,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-07 21:36:32,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-07 21:36:32,317 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-07 21:36:45,328 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-07 21:36:45,829 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-07 21:36:46,339 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-07 21:36:46,690 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-07 21:36:47,025 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-07 21:36:47,343 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:36:47,672 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:36:47,978 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:36:48,284 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:36:48,584 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:36:48,889 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:36:49,162 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:36:49,484 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:36:49,765 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:36:50,014 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:36:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:52,693 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-07 21:36:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-07 21:36:52,693 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-07 21:36:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:52,695 INFO L225 Difference]: With dead ends: 484 [2019-01-07 21:36:52,695 INFO L226 Difference]: Without dead ends: 358 [2019-01-07 21:36:52,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-07 21:36:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-07 21:36:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-07 21:36:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-07 21:36:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-07 21:36:52,760 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-07 21:36:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:52,761 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-07 21:36:52,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-07 21:36:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-07 21:36:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-07 21:36:52,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:52,762 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-07 21:36:52,762 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:36:52,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:52,763 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-07 21:36:52,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:52,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:52,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:36:52,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:52,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:54,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:54,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:54,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:54,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:54,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:54,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:36:54,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:36:54,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:36:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:54,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:58,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:00,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:00,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-07 21:37:00,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:00,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-07 21:37:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-07 21:37:00,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-07 21:37:00,139 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-07 21:37:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:02,467 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-07 21:37:02,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-07 21:37:02,468 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-07 21:37:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:02,469 INFO L225 Difference]: With dead ends: 495 [2019-01-07 21:37:02,470 INFO L226 Difference]: Without dead ends: 236 [2019-01-07 21:37:02,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 21:37:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-07 21:37:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-07 21:37:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-07 21:37:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-07 21:37:02,531 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-07 21:37:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:02,531 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-07 21:37:02,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-07 21:37:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-07 21:37:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-07 21:37:02,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:02,533 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-07 21:37:02,533 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-07 21:37:02,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:02,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:02,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:02,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:02,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:05,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:05,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:05,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:05,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:05,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:05,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:37:05,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:37:05,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:37:05,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-07 21:37:05,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:05,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:11,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:18,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:18,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-07 21:37:18,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:18,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-07 21:37:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-07 21:37:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 21:37:18,426 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-07 21:37:44,316 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-07 21:37:44,948 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-07 21:37:45,582 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-07 21:37:46,175 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-07 21:37:46,735 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-07 21:37:47,260 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-07 21:37:47,770 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:37:48,267 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:37:48,765 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:37:49,230 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:37:49,683 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:37:50,119 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:37:50,545 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:37:51,024 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:37:51,426 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:37:51,802 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:37:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:55,604 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-07 21:37:55,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-07 21:37:55,604 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-07 21:37:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:55,606 INFO L225 Difference]: With dead ends: 629 [2019-01-07 21:37:55,606 INFO L226 Difference]: Without dead ends: 366 [2019-01-07 21:37:55,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-07 21:37:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-07 21:37:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-07 21:37:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-07 21:37:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-07 21:37:55,670 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-07 21:37:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:55,670 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-07 21:37:55,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-07 21:37:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-07 21:37:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-07 21:37:55,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:55,672 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-07 21:37:55,672 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:55,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-07 21:37:55,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:55,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:55,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:55,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:58,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:58,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:58,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:58,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:58,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:58,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:37:58,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:37:58,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:37:58,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:37:58,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:58,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:01,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:02,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:02,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-07 21:38:02,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:02,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-07 21:38:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-07 21:38:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-07 21:38:02,190 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-07 21:38:14,301 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-07 21:38:14,847 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-07 21:38:15,376 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-07 21:38:15,754 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-07 21:38:16,125 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-07 21:38:16,562 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-07 21:38:16,928 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-07 21:38:17,262 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:38:17,593 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:38:17,916 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:38:18,234 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:38:18,538 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:38:18,843 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:38:19,138 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:38:19,434 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:38:19,717 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:38:19,974 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:38:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:22,959 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-07 21:38:22,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-07 21:38:22,960 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-07 21:38:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:22,961 INFO L225 Difference]: With dead ends: 514 [2019-01-07 21:38:22,961 INFO L226 Difference]: Without dead ends: 380 [2019-01-07 21:38:22,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-07 21:38:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-07 21:38:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-07 21:38:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-07 21:38:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-07 21:38:23,026 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-07 21:38:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:23,027 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-07 21:38:23,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-07 21:38:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-07 21:38:23,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-07 21:38:23,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:23,028 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-07 21:38:23,028 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:23,028 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-07 21:38:23,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:23,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:23,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:23,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:23,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:24,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:24,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:24,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:24,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:24,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:24,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:38:24,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:24,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:24,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:26,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:28,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:28,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-07 21:38:28,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:28,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-07 21:38:28,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-07 21:38:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-07 21:38:28,298 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-07 21:38:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:30,901 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-07 21:38:30,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-07 21:38:30,901 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-07 21:38:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:30,903 INFO L225 Difference]: With dead ends: 525 [2019-01-07 21:38:30,903 INFO L226 Difference]: Without dead ends: 250 [2019-01-07 21:38:30,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-07 21:38:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-07 21:38:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-07 21:38:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-07 21:38:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-07 21:38:30,977 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-07 21:38:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:30,977 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-07 21:38:30,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-07 21:38:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-07 21:38:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-07 21:38:30,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:30,979 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-07 21:38:30,979 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:30,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-07 21:38:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:30,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:30,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:34,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:34,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:34,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:34,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:34,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:34,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:38:34,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:34,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:34,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-07 21:38:34,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:34,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:41,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:49,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:49,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-07 21:38:49,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:49,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-07 21:38:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-07 21:38:49,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-07 21:38:49,138 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-07 21:39:17,226 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-07 21:39:17,965 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-07 21:39:18,663 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-07 21:39:19,285 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-07 21:39:19,905 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-07 21:39:20,500 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-07 21:39:21,064 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-07 21:39:21,603 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-07 21:39:22,144 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:39:22,676 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:39:23,259 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:39:23,766 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:39:24,251 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:39:24,714 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:39:25,158 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:39:25,602 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:39:26,029 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:39:26,437 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:39:28,230 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-07 21:39:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:30,625 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-07 21:39:30,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-07 21:39:30,626 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-07 21:39:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:30,628 INFO L225 Difference]: With dead ends: 667 [2019-01-07 21:39:30,628 INFO L226 Difference]: Without dead ends: 388 [2019-01-07 21:39:30,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 50.3s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-07 21:39:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-07 21:39:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-07 21:39:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-07 21:39:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-07 21:39:30,704 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-07 21:39:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:30,704 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-07 21:39:30,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-07 21:39:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-07 21:39:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-07 21:39:30,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:30,705 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-07 21:39:30,705 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-07 21:39:30,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:30,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:30,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:33,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:33,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:33,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:33,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:33,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:33,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:33,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:39:33,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:39:33,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:39:33,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:33,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:37,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:37,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:37,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-07 21:39:37,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:37,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-07 21:39:37,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-07 21:39:37,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-07 21:39:37,462 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-07 21:39:51,766 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-07 21:39:52,355 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-07 21:39:52,931 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-07 21:39:53,347 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-07 21:39:53,808 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-07 21:39:54,225 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-07 21:39:54,628 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-07 21:39:55,015 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-07 21:39:55,379 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-07 21:39:55,731 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:39:56,091 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:39:56,436 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:39:56,767 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:39:57,099 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:39:57,412 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:39:57,711 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:39:58,006 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:39:58,283 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:39:58,552 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:39:58,850 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-07 21:40:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:01,589 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-07 21:40:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-07 21:40:01,589 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-07 21:40:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:01,591 INFO L225 Difference]: With dead ends: 544 [2019-01-07 21:40:01,591 INFO L226 Difference]: Without dead ends: 402 [2019-01-07 21:40:01,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-07 21:40:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-07 21:40:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-07 21:40:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-07 21:40:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-07 21:40:01,665 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-07 21:40:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:01,665 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-07 21:40:01,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-07 21:40:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-07 21:40:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-07 21:40:01,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:01,667 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-07 21:40:01,667 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:01,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-07 21:40:01,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:01,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:40:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:01,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:03,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:03,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:03,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:03,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:03,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:03,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:03,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:05,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:07,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:07,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-07 21:40:07,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:07,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-07 21:40:07,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-07 21:40:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-07 21:40:07,591 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-07 21:40:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:10,742 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-07 21:40:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-07 21:40:10,742 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-07 21:40:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:10,744 INFO L225 Difference]: With dead ends: 555 [2019-01-07 21:40:10,744 INFO L226 Difference]: Without dead ends: 264 [2019-01-07 21:40:10,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-07 21:40:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-07 21:40:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-07 21:40:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-07 21:40:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-07 21:40:10,817 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-07 21:40:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:10,817 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-07 21:40:10,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-07 21:40:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-07 21:40:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-07 21:40:10,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:10,818 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-07 21:40:10,819 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-07 21:40:10,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:10,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:10,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:10,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:13,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:13,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:13,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:13,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:13,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:13,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:13,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:40:13,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:40:14,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-07 21:40:14,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:40:14,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:22,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:30,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-07 21:40:30,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:30,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-07 21:40:30,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-07 21:40:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-07 21:40:30,814 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-07 21:41:02,514 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-07 21:41:03,265 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-07 21:41:04,017 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-07 21:41:04,684 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-07 21:41:05,390 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-07 21:41:06,066 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-07 21:41:06,682 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-07 21:41:07,315 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-07 21:41:07,903 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-07 21:41:08,478 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-07 21:41:09,041 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:41:09,601 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:41:10,121 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:41:10,729 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:41:11,242 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:41:11,733 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:41:12,207 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:41:12,650 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:41:13,090 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:41:13,496 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:41:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:17,922 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-07 21:41:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-07 21:41:17,922 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-07 21:41:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:17,924 INFO L225 Difference]: With dead ends: 705 [2019-01-07 21:41:17,925 INFO L226 Difference]: Without dead ends: 410 [2019-01-07 21:41:17,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-07 21:41:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-07 21:41:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-07 21:41:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-07 21:41:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-07 21:41:18,030 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-07 21:41:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:18,031 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-07 21:41:18,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-07 21:41:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-07 21:41:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-07 21:41:18,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:18,032 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-07 21:41:18,032 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-07 21:41:18,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:18,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:18,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:18,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:18,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:21,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:21,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:21,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:21,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:21,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:21,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:21,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:41:21,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:41:21,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:41:21,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:21,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:25,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:25,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:25,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-07 21:41:25,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:25,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-07 21:41:25,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-07 21:41:25,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-07 21:41:25,466 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-07 21:41:42,092 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-07 21:41:42,706 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-07 21:41:43,361 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-07 21:41:43,828 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-07 21:41:44,299 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-07 21:41:44,755 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-07 21:41:45,204 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-07 21:41:45,636 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-07 21:41:46,073 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-07 21:41:46,546 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-07 21:41:46,943 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-07 21:41:47,324 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-07 21:41:47,719 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-07 21:41:48,085 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-07 21:41:48,432 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-07 21:41:48,784 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-07 21:41:49,109 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-07 21:41:49,433 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-07 21:41:49,740 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-07 21:41:50,033 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-07 21:41:50,316 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-07 21:41:51,677 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-07 21:41:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:53,829 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-01-07 21:41:53,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-07 21:41:53,829 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-01-07 21:41:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:53,830 INFO L225 Difference]: With dead ends: 574 [2019-01-07 21:41:53,830 INFO L226 Difference]: Without dead ends: 424 [2019-01-07 21:41:53,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-01-07 21:41:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-07 21:41:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-01-07 21:41:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-07 21:41:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-01-07 21:41:53,929 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-01-07 21:41:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:53,929 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-01-07 21:41:53,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-07 21:41:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-01-07 21:41:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-07 21:41:53,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:53,931 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-07 21:41:53,931 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-01-07 21:41:53,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:53,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:53,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:53,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:53,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:55,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:55,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:55,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:55,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:55,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:55,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:55,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:55,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:55,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:58,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:00,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:00,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-01-07 21:42:00,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:00,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-07 21:42:00,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-07 21:42:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-01-07 21:42:00,387 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-01-07 21:42:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:03,879 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-01-07 21:42:03,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-07 21:42:03,879 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-01-07 21:42:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:03,881 INFO L225 Difference]: With dead ends: 585 [2019-01-07 21:42:03,881 INFO L226 Difference]: Without dead ends: 278 [2019-01-07 21:42:03,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 21:42:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-07 21:42:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-01-07 21:42:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-07 21:42:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-01-07 21:42:03,970 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-01-07 21:42:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:03,970 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-01-07 21:42:03,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-07 21:42:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-01-07 21:42:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-07 21:42:03,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:03,971 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-07 21:42:03,971 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:03,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-01-07 21:42:03,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:03,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:03,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat