java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:23:51,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:23:51,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:23:51,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:23:51,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:23:51,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:23:51,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:23:51,364 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:23:51,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:23:51,367 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:23:51,368 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:23:51,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:23:51,369 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:23:51,370 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:23:51,371 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:23:51,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:23:51,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:23:51,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:23:51,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:23:51,379 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:23:51,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:23:51,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:23:51,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:23:51,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:23:51,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:23:51,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:23:51,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:23:51,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:23:51,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:23:51,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:23:51,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:23:51,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:23:51,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:23:51,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:23:51,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:23:51,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:23:51,393 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:23:51,414 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:23:51,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:23:51,417 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:23:51,417 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:23:51,417 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:23:51,417 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:23:51,418 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:23:51,418 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:23:51,418 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:23:51,419 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:23:51,419 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:23:51,419 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:23:51,419 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:23:51,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:23:51,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:23:51,420 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:23:51,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:23:51,421 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:23:51,422 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:23:51,422 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:23:51,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:23:51,423 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:23:51,423 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:23:51,423 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:23:51,423 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:23:51,423 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:23:51,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:23:51,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:23:51,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:23:51,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:23:51,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:23:51,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:23:51,425 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:23:51,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:23:51,426 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:23:51,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:23:51,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:23:51,426 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:23:51,427 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:23:51,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:23:51,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:23:51,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:23:51,496 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:23:51,496 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:23:51,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2019-01-20 10:23:51,498 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-01-20 10:23:51,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:23:51,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:23:51,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:23:51,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:23:51,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:23:51,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:23:51,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:23:51,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:23:51,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:23:51,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:23:51,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:23:51,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:23:51,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:23:51,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (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-20 10:23:51,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:23:51,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:23:51,983 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:23:51,983 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-20 10:23:51,984 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:51 BoogieIcfgContainer [2019-01-20 10:23:51,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:23:51,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:23:51,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:23:51,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:23:51,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/2) ... [2019-01-20 10:23:51,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414394a1 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:23:51, skipping insertion in model container [2019-01-20 10:23:51,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:51" (2/2) ... [2019-01-20 10:23:51,997 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-01-20 10:23:52,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:23:52,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 10:23:52,032 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 10:23:52,068 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:23:52,068 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:23:52,068 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:23:52,068 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:23:52,069 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:23:52,069 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:23:52,069 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:23:52,069 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:23:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-20 10:23:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:23:52,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:52,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:23:52,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:52,108 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-20 10:23:52,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:52,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:52,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:52,275 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-20 10:23:52,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:23:52,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:23:52,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:23:52,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:23:52,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:23:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:23:52,296 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-20 10:23:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:52,338 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-20 10:23:52,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:23:52,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 10:23:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:52,351 INFO L225 Difference]: With dead ends: 10 [2019-01-20 10:23:52,352 INFO L226 Difference]: Without dead ends: 6 [2019-01-20 10:23:52,361 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-20 10:23:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-20 10:23:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-20 10:23:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-20 10:23:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-20 10:23:52,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-01-20 10:23:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:52,402 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-20 10:23:52,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:23:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-20 10:23:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:23:52,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:52,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:23:52,404 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-01-20 10:23:52,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:52,628 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-20 10:23:52,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:23:52,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:23:52,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:23:52,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:23:52,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:23:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:23:52,632 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-20 10:23:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:52,700 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-20 10:23:52,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:23:52,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:23:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:52,702 INFO L225 Difference]: With dead ends: 11 [2019-01-20 10:23:52,702 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 10:23:52,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:23:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 10:23:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-20 10:23:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 10:23:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-20 10:23:52,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-20 10:23:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:52,706 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-20 10:23:52,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:23:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-20 10:23:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:23:52,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:52,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:23:52,707 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:52,707 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-20 10:23:52,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:52,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:52,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:52,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:52,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:52,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:23:52,956 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-20 10:23:53,009 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:23:53,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:23:53,068 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-01-20 10:25:29,792 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:25:29,794 INFO L272 AbstractInterpreter]: Visited 6 different actions 129 times. Merged at 5 different actions 84 times. Widened at 4 different actions 58 times. Found 37 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:25:29,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:29,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:25:29,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:29,800 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-20 10:25:29,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:29,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:29,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:30,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:30,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:30,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:30,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:25:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:30,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:30,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:30,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:30,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:30,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:25:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:30,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:30,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-20 10:25:30,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:30,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:25:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:25:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:25:30,533 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-01-20 10:25:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:30,882 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-20 10:25:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:25:30,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:25:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:30,883 INFO L225 Difference]: With dead ends: 12 [2019-01-20 10:25:30,883 INFO L226 Difference]: Without dead ends: 8 [2019-01-20 10:25:30,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:25:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-20 10:25:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-20 10:25:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 10:25:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-20 10:25:30,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-01-20 10:25:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:30,887 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-20 10:25:30,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:25:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-20 10:25:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:25:30,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:30,888 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:25:30,888 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:30,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:30,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-01-20 10:25:30,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:30,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:30,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:30,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:30,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:30,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:30,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:30,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:30,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:30,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:30,973 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-20 10:25:30,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:30,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:30,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:25:30,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:30,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:30,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:31,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:31,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-01-20 10:25:31,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:31,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:25:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:25:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:25:31,089 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-01-20 10:25:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:31,412 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-20 10:25:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:25:31,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-20 10:25:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:31,413 INFO L225 Difference]: With dead ends: 11 [2019-01-20 10:25:31,413 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 10:25:31,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:25:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 10:25:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-20 10:25:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 10:25:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-20 10:25:31,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-01-20 10:25:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:31,417 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-20 10:25:31,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:25:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-20 10:25:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:25:31,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:31,418 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-20 10:25:31,418 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-01-20 10:25:31,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:31,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:31,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:31,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:31,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:31,606 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:31,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:31,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:31,607 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-20 10:25:31,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:31,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:31,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:31,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:31,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:31,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:31,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:31,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:31,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:25:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:25:31,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:31,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:31,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:31,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:31,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:25:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:25:32,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:32,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-01-20 10:25:32,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:32,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:25:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:25:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:25:32,044 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-01-20 10:25:32,325 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-20 10:25:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:32,525 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-20 10:25:32,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 10:25:32,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:25:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:32,527 INFO L225 Difference]: With dead ends: 17 [2019-01-20 10:25:32,527 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 10:25:32,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:25:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 10:25:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 10:25:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 10:25:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-20 10:25:32,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-20 10:25:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:32,532 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-20 10:25:32,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:25:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-20 10:25:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:25:32,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:32,533 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-20 10:25:32,534 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:32,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-01-20 10:25:32,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:32,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:32,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:32,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:32,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:32,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:32,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:32,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:32,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:32,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:32,710 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-20 10:25:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:32,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:32,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:32,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:32,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:32,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:32,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:25:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:32,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:32,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:32,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:32,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:32,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:25:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:32,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:32,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-01-20 10:25:32,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:32,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 10:25:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 10:25:32,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:25:32,979 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-01-20 10:25:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:33,377 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-20 10:25:33,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 10:25:33,377 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-01-20 10:25:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:33,377 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:25:33,377 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 10:25:33,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:25:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 10:25:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-20 10:25:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:25:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-20 10:25:33,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-01-20 10:25:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:33,382 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-20 10:25:33,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 10:25:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-20 10:25:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 10:25:33,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:33,383 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-01-20 10:25:33,383 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:33,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-01-20 10:25:33,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:33,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:33,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:33,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:33,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:33,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:33,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:33,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:33,500 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-20 10:25:33,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:33,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:33,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:25:33,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:33,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:33,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:34,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:34,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-20 10:25:34,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:34,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:25:34,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:25:34,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:25:34,014 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-01-20 10:25:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:34,076 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-20 10:25:34,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:25:34,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-20 10:25:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:34,078 INFO L225 Difference]: With dead ends: 15 [2019-01-20 10:25:34,078 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 10:25:34,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:25:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 10:25:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-20 10:25:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:25:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-20 10:25:34,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-01-20 10:25:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:34,083 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-20 10:25:34,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:25:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-20 10:25:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 10:25:34,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:34,084 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-20 10:25:34,084 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-01-20 10:25:34,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:34,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:34,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:34,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:34,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:34,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:34,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:34,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:34,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:34,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:34,270 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-20 10:25:34,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:34,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:34,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:34,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:34,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:34,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:34,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:34,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:34,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:25:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 10:25:34,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:34,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:34,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:34,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:34,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:25:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 10:25:34,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:34,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-01-20 10:25:34,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:34,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 10:25:34,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 10:25:34,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:25:34,840 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-01-20 10:25:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:35,434 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-20 10:25:35,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 10:25:35,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-01-20 10:25:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:35,435 INFO L225 Difference]: With dead ends: 23 [2019-01-20 10:25:35,435 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 10:25:35,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-01-20 10:25:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 10:25:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-20 10:25:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 10:25:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-20 10:25:35,442 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-20 10:25:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:35,442 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-20 10:25:35,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 10:25:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-20 10:25:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-20 10:25:35,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:35,443 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-20 10:25:35,443 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-01-20 10:25:35,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:35,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:35,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:35,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:35,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:35,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:35,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:35,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:35,691 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-20 10:25:35,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:35,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:35,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:35,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:35,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:35,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:35,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:25:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:35,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:35,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:35,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:35,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:35,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:25:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:36,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:36,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-01-20 10:25:36,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:36,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 10:25:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 10:25:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:25:36,111 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-01-20 10:25:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:36,764 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-20 10:25:36,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 10:25:36,765 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-01-20 10:25:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:36,766 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:25:36,766 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 10:25:36,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-01-20 10:25:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 10:25:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-20 10:25:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:25:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-20 10:25:36,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-01-20 10:25:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:36,773 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-20 10:25:36,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 10:25:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-20 10:25:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-20 10:25:36,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:36,773 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-01-20 10:25:36,774 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-01-20 10:25:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:36,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:36,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:36,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:36,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:36,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:36,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:36,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:36,875 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-20 10:25:36,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:36,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:36,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:25:36,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:36,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:36,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:37,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:37,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-01-20 10:25:37,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:37,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:25:37,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:25:37,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:25:37,119 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-01-20 10:25:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:37,252 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-20 10:25:37,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 10:25:37,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-20 10:25:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:37,255 INFO L225 Difference]: With dead ends: 19 [2019-01-20 10:25:37,255 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:25:37,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:25:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:25:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 10:25:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:25:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-20 10:25:37,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-20 10:25:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:37,261 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-20 10:25:37,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:25:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-20 10:25:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 10:25:37,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:37,262 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-20 10:25:37,263 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:37,263 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-01-20 10:25:37,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:37,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:37,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:37,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:37,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:37,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:37,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:37,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:37,543 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-20 10:25:37,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:37,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:37,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:37,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:37,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:37,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:37,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:37,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:37,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:25:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 10:25:37,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:37,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:37,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:37,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:37,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:25:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 10:25:38,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:38,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-01-20 10:25:38,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:38,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 10:25:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 10:25:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-01-20 10:25:38,320 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-01-20 10:25:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:39,195 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-01-20 10:25:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 10:25:39,196 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-01-20 10:25:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:39,196 INFO L225 Difference]: With dead ends: 29 [2019-01-20 10:25:39,196 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 10:25:39,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 10:25:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 10:25:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-20 10:25:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 10:25:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-20 10:25:39,204 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-20 10:25:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:39,204 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-20 10:25:39,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 10:25:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-20 10:25:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-20 10:25:39,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:39,205 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-20 10:25:39,205 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-01-20 10:25:39,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:39,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:39,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:39,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:39,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:39,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:39,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:39,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:39,466 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-20 10:25:39,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:39,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:39,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:39,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:39,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:39,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:39,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:25:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:39,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:39,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:39,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:39,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:39,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:25:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:39,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:39,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-01-20 10:25:39,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:39,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 10:25:39,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 10:25:39,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-01-20 10:25:39,880 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-01-20 10:25:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:40,646 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-20 10:25:40,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 10:25:40,646 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-01-20 10:25:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:40,647 INFO L225 Difference]: With dead ends: 30 [2019-01-20 10:25:40,647 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:25:40,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:25:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:25:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-20 10:25:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:25:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-20 10:25:40,653 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-01-20 10:25:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:40,653 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-20 10:25:40,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 10:25:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-20 10:25:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-20 10:25:40,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:40,654 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-01-20 10:25:40,654 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-01-20 10:25:40,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:40,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:40,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:40,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:40,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:40,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:40,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:40,768 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-20 10:25:40,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:40,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:40,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-20 10:25:40,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:40,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:40,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:41,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:41,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-01-20 10:25:41,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:41,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:25:41,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:25:41,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:25:41,995 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-01-20 10:25:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:42,198 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-20 10:25:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 10:25:42,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-20 10:25:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:42,200 INFO L225 Difference]: With dead ends: 23 [2019-01-20 10:25:42,201 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 10:25:42,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:25:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 10:25:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-20 10:25:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 10:25:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-20 10:25:42,207 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-01-20 10:25:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:42,208 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-20 10:25:42,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:25:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-20 10:25:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 10:25:42,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:42,208 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-20 10:25:42,208 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:42,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-01-20 10:25:42,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:42,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:42,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:42,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:42,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:42,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:42,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:42,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:42,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:42,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:42,554 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-20 10:25:42,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:42,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:42,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:42,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:42,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:42,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:42,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:42,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:42,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:25:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 10:25:42,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:42,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:42,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:42,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:42,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:25:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 10:25:43,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:43,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-01-20 10:25:43,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:43,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 10:25:43,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 10:25:43,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:25:43,299 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-01-20 10:25:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:44,303 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-20 10:25:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 10:25:44,303 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-01-20 10:25:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:44,304 INFO L225 Difference]: With dead ends: 35 [2019-01-20 10:25:44,304 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 10:25:44,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-01-20 10:25:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 10:25:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-20 10:25:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:25:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-20 10:25:44,314 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-20 10:25:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:44,314 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-20 10:25:44,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 10:25:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-20 10:25:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-20 10:25:44,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:44,315 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-20 10:25:44,316 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-01-20 10:25:44,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:44,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:44,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:44,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:44,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:44,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:44,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:44,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:44,949 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-20 10:25:44,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:44,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:44,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:45,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:45,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:45,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:45,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:25:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:45,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:45,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:45,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:45,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:45,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:25:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:45,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:45,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-01-20 10:25:45,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:45,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 10:25:45,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 10:25:45,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:25:45,532 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-01-20 10:25:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:46,372 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-20 10:25:46,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 10:25:46,372 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-01-20 10:25:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:46,373 INFO L225 Difference]: With dead ends: 36 [2019-01-20 10:25:46,373 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:25:46,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 10:25:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:25:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-20 10:25:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 10:25:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-20 10:25:46,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-01-20 10:25:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:46,383 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-20 10:25:46,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 10:25:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-20 10:25:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-20 10:25:46,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:46,384 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-01-20 10:25:46,384 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:46,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-01-20 10:25:46,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:46,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:46,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:46,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:46,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:46,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:46,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:46,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:46,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:46,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:46,524 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-20 10:25:46,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:46,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:46,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-20 10:25:46,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:46,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:46,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:46,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:46,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-01-20 10:25:46,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:46,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:25:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:25:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:25:46,744 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-01-20 10:25:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:46,877 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-20 10:25:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 10:25:46,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-20 10:25:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:46,879 INFO L225 Difference]: With dead ends: 27 [2019-01-20 10:25:46,879 INFO L226 Difference]: Without dead ends: 25 [2019-01-20 10:25:46,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:25:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-20 10:25:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-20 10:25:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:25:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-20 10:25:46,888 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-01-20 10:25:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:46,888 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-20 10:25:46,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:25:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-20 10:25:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 10:25:46,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:46,889 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-20 10:25:46,889 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:46,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-01-20 10:25:46,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:46,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:46,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:46,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:46,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:47,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:47,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:47,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:47,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:47,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:47,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:25:47,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:47,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:47,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:47,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:47,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:47,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:47,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:47,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:47,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:25:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 10:25:47,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:48,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:48,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:48,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:48,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:25:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 10:25:48,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:48,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-01-20 10:25:48,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:48,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 10:25:48,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 10:25:48,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 10:25:48,410 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-01-20 10:25:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:50,123 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-20 10:25:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 10:25:50,125 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-01-20 10:25:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:50,126 INFO L225 Difference]: With dead ends: 41 [2019-01-20 10:25:50,126 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 10:25:50,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-01-20 10:25:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 10:25:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-20 10:25:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 10:25:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-20 10:25:50,139 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-20 10:25:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:50,139 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-20 10:25:50,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 10:25:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-20 10:25:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-20 10:25:50,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:50,140 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-20 10:25:50,140 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-01-20 10:25:50,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:50,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:50,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:50,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:50,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:50,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:50,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:50,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:50,597 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-20 10:25:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:50,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:50,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:51,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:51,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:51,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:51,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:25:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:51,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:51,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:51,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:51,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:51,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:25:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:51,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:51,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-01-20 10:25:51,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:51,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 10:25:51,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 10:25:51,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 10:25:51,278 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-01-20 10:25:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:52,459 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-20 10:25:52,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 10:25:52,460 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-01-20 10:25:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:52,460 INFO L225 Difference]: With dead ends: 42 [2019-01-20 10:25:52,461 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 10:25:52,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 10:25:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 10:25:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-20 10:25:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 10:25:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-20 10:25:52,472 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-01-20 10:25:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:52,472 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-20 10:25:52,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 10:25:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-20 10:25:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-20 10:25:52,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:52,473 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-01-20 10:25:52,473 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:52,474 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-01-20 10:25:52,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:52,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:52,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:52,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:52,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:52,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:52,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:52,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:52,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:52,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:52,696 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-20 10:25:52,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:52,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:52,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-20 10:25:52,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:52,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:52,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:54,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:54,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-01-20 10:25:54,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:54,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-20 10:25:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-20 10:25:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:25:54,360 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-01-20 10:25:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:54,561 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-20 10:25:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 10:25:54,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-20 10:25:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:54,562 INFO L225 Difference]: With dead ends: 31 [2019-01-20 10:25:54,562 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 10:25:54,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-01-20 10:25:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 10:25:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-20 10:25:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:25:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-20 10:25:54,573 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-01-20 10:25:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:54,573 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-20 10:25:54,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-20 10:25:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-20 10:25:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 10:25:54,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:54,574 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-20 10:25:54,574 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:54,574 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-01-20 10:25:54,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:54,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:54,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:55,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:55,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:55,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:55,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:55,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:55,054 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-20 10:25:55,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:55,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:55,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:55,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:55,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:55,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:55,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:55,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:55,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:25:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 10:25:55,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:55,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:25:55,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:55,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:55,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:25:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 10:25:56,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:56,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-01-20 10:25:56,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:56,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 10:25:56,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 10:25:56,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 10:25:56,288 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-01-20 10:25:57,420 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-20 10:25:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:58,474 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-20 10:25:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 10:25:58,475 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-01-20 10:25:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:58,475 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:25:58,475 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 10:25:58,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:25:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 10:25:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-20 10:25:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:25:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-20 10:25:58,487 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-20 10:25:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:58,487 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-20 10:25:58,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 10:25:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-20 10:25:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 10:25:58,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:58,488 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-20 10:25:58,489 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-01-20 10:25:58,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:58,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:58,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:58,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:58,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:59,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:59,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:59,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:59,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:59,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:59,478 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-20 10:25:59,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:59,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:59,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:00,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:00,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:00,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:00,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:26:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:00,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:00,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:00,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:00,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:00,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:26:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:00,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:00,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-01-20 10:26:00,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:00,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 10:26:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 10:26:00,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 10:26:00,321 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-01-20 10:26:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:01,613 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-20 10:26:01,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 10:26:01,614 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-01-20 10:26:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:01,614 INFO L225 Difference]: With dead ends: 48 [2019-01-20 10:26:01,615 INFO L226 Difference]: Without dead ends: 32 [2019-01-20 10:26:01,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:26:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-20 10:26:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-20 10:26:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:26:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-20 10:26:01,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-01-20 10:26:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:01,628 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-20 10:26:01,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 10:26:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-20 10:26:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-20 10:26:01,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:01,629 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-01-20 10:26:01,629 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-01-20 10:26:01,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:01,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:01,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:01,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:01,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:01,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:01,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:01,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:01,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:01,831 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-20 10:26:01,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:01,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:01,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 10:26:01,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:01,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:01,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:02,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:02,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-01-20 10:26:02,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:02,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 10:26:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 10:26:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:26:02,118 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-01-20 10:26:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:02,332 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-20 10:26:02,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 10:26:02,333 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-20 10:26:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:02,334 INFO L225 Difference]: With dead ends: 35 [2019-01-20 10:26:02,334 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 10:26:02,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-01-20 10:26:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 10:26:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-20 10:26:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:26:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-20 10:26:02,350 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-01-20 10:26:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:02,350 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-20 10:26:02,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 10:26:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-20 10:26:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 10:26:02,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:02,351 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-20 10:26:02,351 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-01-20 10:26:02,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:02,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:02,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:03,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:03,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:03,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:03,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:03,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:03,077 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-20 10:26:03,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:03,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:03,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:03,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:03,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:03,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:03,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:03,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:03,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:26:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 10:26:03,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:03,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:03,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:03,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:03,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:26:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 10:26:04,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:04,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-01-20 10:26:04,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:04,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:26:04,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:26:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:26:04,687 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-01-20 10:26:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:06,593 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-20 10:26:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 10:26:06,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-01-20 10:26:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:06,594 INFO L225 Difference]: With dead ends: 53 [2019-01-20 10:26:06,595 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:26:06,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2019-01-20 10:26:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:26:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-20 10:26:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:26:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-20 10:26:06,608 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-20 10:26:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:06,608 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-20 10:26:06,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:26:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-20 10:26:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 10:26:06,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:06,609 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-20 10:26:06,609 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-01-20 10:26:06,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:06,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:06,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:06,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:06,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:07,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:07,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:07,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:07,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:07,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:07,921 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-20 10:26:07,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:07,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:07,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:08,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:08,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:08,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:08,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:26:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:08,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:08,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:08,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:08,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:08,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:26:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:08,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:08,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-01-20 10:26:08,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:08,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 10:26:08,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 10:26:08,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 10:26:08,935 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-01-20 10:26:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:10,886 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-20 10:26:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 10:26:10,886 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-01-20 10:26:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:10,887 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:26:10,887 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:26:10,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:26:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:26:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-20 10:26:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:26:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-20 10:26:10,904 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-01-20 10:26:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:10,905 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-20 10:26:10,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 10:26:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-20 10:26:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-20 10:26:10,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:10,905 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-01-20 10:26:10,906 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-01-20 10:26:10,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:10,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:10,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:11,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:11,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:11,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:11,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:11,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:11,449 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-20 10:26:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:11,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:11,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-20 10:26:11,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:11,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:11,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:11,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:11,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-01-20 10:26:11,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:11,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-20 10:26:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-20 10:26:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:26:11,763 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-01-20 10:26:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:11,996 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-20 10:26:11,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 10:26:11,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-01-20 10:26:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:11,997 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:26:11,997 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 10:26:11,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 10:26:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 10:26:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-20 10:26:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:26:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-20 10:26:12,014 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-01-20 10:26:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:12,015 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-20 10:26:12,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-20 10:26:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-20 10:26:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 10:26:12,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:12,016 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-20 10:26:12,016 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-01-20 10:26:12,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:12,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:12,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:12,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:12,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:13,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:13,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:13,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:13,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:13,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:13,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 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-20 10:26:13,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:13,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:13,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:13,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:13,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:13,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:13,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:13,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:13,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:26:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 10:26:13,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:13,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:13,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:14,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:14,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:26:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 10:26:15,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:15,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-01-20 10:26:15,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:15,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 10:26:15,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 10:26:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:26:15,130 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-01-20 10:26:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:17,482 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-20 10:26:17,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 10:26:17,482 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-01-20 10:26:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:17,483 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:26:17,483 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 10:26:17,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-01-20 10:26:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 10:26:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-20 10:26:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:26:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-20 10:26:17,502 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-20 10:26:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:17,502 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-20 10:26:17,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 10:26:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-20 10:26:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-20 10:26:17,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:17,503 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-20 10:26:17,503 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:17,503 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-01-20 10:26:17,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:17,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:17,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:17,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:17,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:18,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:18,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:18,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:18,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:18,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:18,475 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-20 10:26:18,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:18,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:18,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:19,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:19,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:19,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:19,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:26:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:19,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:19,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:19,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:19,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:19,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:26:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:20,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:20,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-01-20 10:26:20,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:20,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 10:26:20,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 10:26:20,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 10:26:20,025 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-01-20 10:26:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:22,137 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-20 10:26:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 10:26:22,137 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-01-20 10:26:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:22,138 INFO L225 Difference]: With dead ends: 60 [2019-01-20 10:26:22,138 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 10:26:22,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 10:26:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 10:26:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-20 10:26:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:26:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-20 10:26:22,155 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-01-20 10:26:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:22,155 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-20 10:26:22,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 10:26:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-20 10:26:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-20 10:26:22,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:22,156 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-01-20 10:26:22,156 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-01-20 10:26:22,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:22,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:22,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:22,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:22,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:22,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:22,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:22,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:22,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:22,401 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-20 10:26:22,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:22,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:22,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-20 10:26:22,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:22,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:22,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:22,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:22,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-01-20 10:26:22,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:22,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-20 10:26:22,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-20 10:26:22,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:26:22,819 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-01-20 10:26:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:23,083 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-20 10:26:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 10:26:23,083 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-20 10:26:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:23,084 INFO L225 Difference]: With dead ends: 43 [2019-01-20 10:26:23,084 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 10:26:23,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-01-20 10:26:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 10:26:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-20 10:26:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:26:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-20 10:26:23,100 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-01-20 10:26:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:23,101 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-20 10:26:23,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-20 10:26:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-20 10:26:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 10:26:23,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:23,101 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-20 10:26:23,101 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:23,102 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-01-20 10:26:23,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:23,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:23,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:23,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:24,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:24,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:24,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:24,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:24,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:24,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:26:24,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:24,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:24,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:24,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:24,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:25,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:25,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:25,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:25,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:26:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 10:26:25,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:25,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:25,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:25,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:25,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:26:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 10:26:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:26,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-01-20 10:26:26,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:26,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 10:26:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 10:26:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 10:26:26,684 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-01-20 10:26:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:29,345 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-20 10:26:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:26:29,346 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-01-20 10:26:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:29,346 INFO L225 Difference]: With dead ends: 65 [2019-01-20 10:26:29,346 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 10:26:29,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 10:26:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 10:26:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-20 10:26:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 10:26:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-20 10:26:29,372 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-20 10:26:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:29,372 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-20 10:26:29,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 10:26:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-20 10:26:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-20 10:26:29,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:29,373 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-20 10:26:29,373 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-01-20 10:26:29,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:29,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:29,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:30,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:30,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:30,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:30,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:30,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:30,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 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-20 10:26:30,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:30,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:30,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:31,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:31,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:31,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:31,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:26:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:31,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:31,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:31,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:31,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:31,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:26:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:32,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:32,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-01-20 10:26:32,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:32,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 10:26:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 10:26:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 10:26:32,023 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-01-20 10:26:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:34,541 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-20 10:26:34,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 10:26:34,541 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-01-20 10:26:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:34,542 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:26:34,542 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:26:34,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:26:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:26:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-20 10:26:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-20 10:26:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-20 10:26:34,567 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-01-20 10:26:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:34,567 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-20 10:26:34,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 10:26:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-20 10:26:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-20 10:26:34,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:34,568 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-01-20 10:26:34,568 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-01-20 10:26:34,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:34,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:34,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:35,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:35,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:35,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:35,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:35,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:35,079 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-20 10:26:35,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:35,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:35,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 10:26:35,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:35,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:35,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:35,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:35,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-01-20 10:26:35,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:35,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 10:26:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 10:26:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:26:35,588 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-01-20 10:26:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:35,899 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-20 10:26:35,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 10:26:35,900 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-20 10:26:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:35,901 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:26:35,901 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 10:26:35,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-01-20 10:26:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 10:26:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-20 10:26:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 10:26:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-20 10:26:35,919 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-01-20 10:26:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:35,919 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-20 10:26:35,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 10:26:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-20 10:26:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 10:26:35,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:35,920 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-20 10:26:35,920 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:35,920 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-01-20 10:26:35,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:35,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:35,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:35,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:35,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:36,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:36,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:36,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:36,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:36,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:36,973 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-20 10:26:36,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:36,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:37,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:37,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:37,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:38,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:38,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:38,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:38,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:26:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 10:26:38,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:38,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:38,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:38,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:38,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:26:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 10:26:39,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:39,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-01-20 10:26:39,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:39,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:26:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:26:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:26:39,464 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-01-20 10:26:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:43,018 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-20 10:26:43,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:26:43,019 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-01-20 10:26:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:43,019 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:26:43,020 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 10:26:43,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2019-01-20 10:26:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 10:26:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-20 10:26:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:26:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-20 10:26:43,040 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-20 10:26:43,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:43,040 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-20 10:26:43,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:26:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-20 10:26:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-20 10:26:43,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:43,041 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-20 10:26:43,041 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:43,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:43,041 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-01-20 10:26:43,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:43,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:43,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:45,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:45,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:45,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:45,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:45,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:45,265 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-20 10:26:45,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:45,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:45,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:46,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:46,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:46,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:46,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:26:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:46,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:46,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:46,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:46,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:46,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:26:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:47,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:47,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-01-20 10:26:47,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:47,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 10:26:47,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 10:26:47,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:26:47,037 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-01-20 10:26:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:50,108 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-20 10:26:50,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 10:26:50,108 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-01-20 10:26:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:50,109 INFO L225 Difference]: With dead ends: 72 [2019-01-20 10:26:50,109 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:26:50,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:26:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:26:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-20 10:26:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 10:26:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-20 10:26:50,129 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-01-20 10:26:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:50,129 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-20 10:26:50,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 10:26:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-20 10:26:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-20 10:26:50,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:50,130 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-01-20 10:26:50,130 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-01-20 10:26:50,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:50,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:50,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:50,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:50,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:50,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:50,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:50,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:50,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:50,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:50,524 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-20 10:26:50,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:50,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:50,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-20 10:26:50,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:50,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:50,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:51,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:51,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-01-20 10:26:51,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:51,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-20 10:26:51,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-20 10:26:51,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-01-20 10:26:51,541 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-01-20 10:26:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:51,895 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-20 10:26:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 10:26:51,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-01-20 10:26:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:51,896 INFO L225 Difference]: With dead ends: 51 [2019-01-20 10:26:51,897 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 10:26:51,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 10:26:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 10:26:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-20 10:26:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 10:26:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-20 10:26:51,917 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-01-20 10:26:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:51,917 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-20 10:26:51,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-20 10:26:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-20 10:26:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 10:26:51,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:51,918 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-20 10:26:51,918 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-01-20 10:26:51,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:51,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:51,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:51,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:51,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:53,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:53,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:53,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:53,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:53,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:53,133 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-20 10:26:53,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:53,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:53,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:53,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:53,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:54,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:54,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:54,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:54,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:26:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 10:26:54,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:54,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:26:54,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:54,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:54,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:26:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 10:26:56,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:56,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-01-20 10:26:56,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:56,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:26:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:26:56,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:26:56,331 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-01-20 10:27:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:00,407 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-20 10:27:00,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:27:00,408 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-01-20 10:27:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:00,408 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:27:00,408 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:27:00,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-01-20 10:27:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:27:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-20 10:27:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:27:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-20 10:27:00,431 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-20 10:27:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:00,431 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-20 10:27:00,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:27:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-20 10:27:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-20 10:27:00,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:00,432 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-20 10:27:00,432 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-01-20 10:27:00,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:00,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:00,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:02,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:02,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:02,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:02,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:02,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:02,040 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-20 10:27:02,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:02,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:02,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:03,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:03,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:03,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:03,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:27:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:03,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:03,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:27:03,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:03,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:03,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:27:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:04,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:04,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-01-20 10:27:04,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:04,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 10:27:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 10:27:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 10:27:04,116 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-01-20 10:27:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:07,398 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-20 10:27:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 10:27:07,398 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-01-20 10:27:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:07,399 INFO L225 Difference]: With dead ends: 78 [2019-01-20 10:27:07,399 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:27:07,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 10:27:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:27:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-20 10:27:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 10:27:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-20 10:27:07,421 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-01-20 10:27:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-20 10:27:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 10:27:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-20 10:27:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-20 10:27:07,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:07,421 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-01-20 10:27:07,422 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-01-20 10:27:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:07,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:07,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:07,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:07,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:07,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:07,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:07,890 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-20 10:27:07,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:07,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:07,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 10:27:08,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:08,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:08,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:08,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:08,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-01-20 10:27:08,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:08,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 10:27:08,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 10:27:08,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-01-20 10:27:08,526 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-01-20 10:27:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:08,918 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-20 10:27:08,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 10:27:08,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-01-20 10:27:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:08,918 INFO L225 Difference]: With dead ends: 55 [2019-01-20 10:27:08,919 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:27:08,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-01-20 10:27:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:27:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-20 10:27:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 10:27:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-20 10:27:08,945 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-01-20 10:27:08,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:08,945 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-20 10:27:08,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 10:27:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-20 10:27:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 10:27:08,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:08,946 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-20 10:27:08,946 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-01-20 10:27:08,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:08,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:08,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:08,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:10,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:10,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:10,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:10,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:10,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:10,434 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-20 10:27:10,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:10,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:10,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:10,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:10,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:12,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:12,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:12,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:12,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:27:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 10:27:12,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:12,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:27:12,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:12,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:12,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:27:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 10:27:14,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:14,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-01-20 10:27:14,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:14,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:27:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:27:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 10:27:14,006 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-01-20 10:27:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:18,462 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-01-20 10:27:18,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:27:18,462 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-01-20 10:27:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:18,463 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:27:18,463 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:27:18,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-01-20 10:27:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:27:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-20 10:27:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:27:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-20 10:27:18,494 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-20 10:27:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:18,494 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-20 10:27:18,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:27:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-20 10:27:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-20 10:27:18,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:18,495 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-20 10:27:18,495 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-01-20 10:27:18,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:18,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:18,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:18,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:18,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:19,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:19,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:19,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:19,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:19,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:19,965 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-20 10:27:19,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:19,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:20,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:21,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:21,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:21,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:21,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:27:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:21,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:22,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:27:22,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:22,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:22,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:27:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-01-20 10:27:22,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:22,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 10:27:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 10:27:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 10:27:22,632 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-01-20 10:27:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:26,699 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-01-20 10:27:26,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 10:27:26,699 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-01-20 10:27:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:26,700 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:27:26,700 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 10:27:26,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 10:27:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 10:27:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-20 10:27:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 10:27:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-20 10:27:26,725 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-01-20 10:27:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:26,725 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-20 10:27:26,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 10:27:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-20 10:27:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 10:27:26,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:26,726 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-01-20 10:27:26,726 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:26,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-01-20 10:27:26,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:26,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:26,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:26,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:26,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:27,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:27,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:27,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:27,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:27,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:27,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:27:27,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:27,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:27,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-20 10:27:27,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:27,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:27,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:27,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-01-20 10:27:27,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:27,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 10:27:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 10:27:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-01-20 10:27:27,942 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-01-20 10:27:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:28,417 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-20 10:27:28,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 10:27:28,417 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-01-20 10:27:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:28,417 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:27:28,418 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:27:28,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-01-20 10:27:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:27:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-20 10:27:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 10:27:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-20 10:27:28,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-01-20 10:27:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:28,444 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-20 10:27:28,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 10:27:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-20 10:27:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 10:27:28,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:28,445 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-20 10:27:28,445 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:28,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-01-20 10:27:28,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:28,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:28,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:28,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:28,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:30,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:30,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:30,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:30,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:30,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:30,477 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-20 10:27:30,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:30,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:30,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:30,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:30,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:32,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:32,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:32,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:32,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:27:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 10:27:32,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:32,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:27:32,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:32,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:32,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:27:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 10:27:34,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:34,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-01-20 10:27:34,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:34,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 10:27:34,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 10:27:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 10:27:34,630 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-01-20 10:27:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:39,905 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-20 10:27:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:27:39,905 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-01-20 10:27:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:39,906 INFO L225 Difference]: With dead ends: 89 [2019-01-20 10:27:39,906 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 10:27:39,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2019-01-20 10:27:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 10:27:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-20 10:27:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:27:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-20 10:27:39,936 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-20 10:27:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:39,937 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-20 10:27:39,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 10:27:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-20 10:27:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 10:27:39,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:39,937 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-20 10:27:39,937 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:39,938 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-01-20 10:27:39,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:39,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:39,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:39,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:39,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:41,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:41,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:41,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:41,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:41,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:41,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 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-20 10:27:41,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:41,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:42,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:43,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:43,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:43,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:43,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:27:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:43,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:43,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:27:43,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:44,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:44,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:27:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:44,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:44,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-01-20 10:27:44,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:44,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 10:27:44,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 10:27:44,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 10:27:44,727 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-01-20 10:27:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:49,385 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-20 10:27:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 10:27:49,385 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-01-20 10:27:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:49,386 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:27:49,386 INFO L226 Difference]: Without dead ends: 60 [2019-01-20 10:27:49,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:27:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-20 10:27:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-20 10:27:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-20 10:27:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-20 10:27:49,415 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-01-20 10:27:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:49,415 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-20 10:27:49,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 10:27:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-20 10:27:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-20 10:27:49,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:49,416 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-01-20 10:27:49,416 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-01-20 10:27:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:49,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:49,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:49,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:49,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:49,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:49,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:49,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:49,992 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-20 10:27:50,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:50,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:50,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-20 10:27:50,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:50,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:50,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:50,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:50,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-01-20 10:27:50,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:50,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-20 10:27:50,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-20 10:27:50,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-01-20 10:27:50,822 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-01-20 10:27:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:51,315 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-20 10:27:51,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 10:27:51,316 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-01-20 10:27:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:51,316 INFO L225 Difference]: With dead ends: 63 [2019-01-20 10:27:51,317 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 10:27:51,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 10:27:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 10:27:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-20 10:27:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:27:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-20 10:27:51,350 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-01-20 10:27:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:51,350 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-20 10:27:51,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-20 10:27:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-20 10:27:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 10:27:51,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:51,351 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-20 10:27:51,351 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:51,352 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-01-20 10:27:51,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:51,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:51,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:51,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:53,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:53,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:53,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:53,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:53,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:53,684 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-20 10:27:53,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:53,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:53,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:53,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:53,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:55,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:55,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:55,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:55,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:27:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 10:27:55,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:55,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:27:55,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:55,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:55,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:27:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 10:27:58,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:58,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-01-20 10:27:58,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:58,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:27:58,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:27:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:27:58,413 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-01-20 10:28:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:03,935 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-20 10:28:03,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 10:28:03,935 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-01-20 10:28:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:03,936 INFO L225 Difference]: With dead ends: 95 [2019-01-20 10:28:03,936 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 10:28:03,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-01-20 10:28:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 10:28:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-20 10:28:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 10:28:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-20 10:28:03,969 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-20 10:28:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:03,969 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-20 10:28:03,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:28:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-20 10:28:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 10:28:03,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:03,969 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-20 10:28:03,970 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-01-20 10:28:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:03,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:03,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:03,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:05,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:05,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:05,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:05,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:05,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:05,868 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-20 10:28:05,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:05,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:05,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:08,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:28:08,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:08,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:08,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:28:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:08,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:08,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:28:08,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:08,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:08,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:28:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:09,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:09,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-01-20 10:28:09,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:09,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:28:09,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:28:09,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:28:09,291 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-01-20 10:28:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:14,479 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-01-20 10:28:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:28:14,479 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-01-20 10:28:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:14,480 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:28:14,480 INFO L226 Difference]: Without dead ends: 64 [2019-01-20 10:28:14,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:28:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-20 10:28:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-20 10:28:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 10:28:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-01-20 10:28:14,512 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-01-20 10:28:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:14,512 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-01-20 10:28:14,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:28:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-01-20 10:28:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-20 10:28:14,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:14,513 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-01-20 10:28:14,513 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-01-20 10:28:14,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:14,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:14,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:15,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:15,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:15,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:15,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:15,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:15,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 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-20 10:28:15,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:15,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:15,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 10:28:15,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:15,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:15,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:16,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:16,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-01-20 10:28:16,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:16,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-20 10:28:16,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-20 10:28:16,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-01-20 10:28:16,220 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-01-20 10:28:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:16,799 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-20 10:28:16,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:28:16,799 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-01-20 10:28:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:16,799 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:28:16,799 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:28:16,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-01-20 10:28:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:28:16,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-20 10:28:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 10:28:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-20 10:28:16,831 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-01-20 10:28:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:16,831 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-20 10:28:16,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-20 10:28:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-20 10:28:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 10:28:16,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:16,832 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-20 10:28:16,832 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-01-20 10:28:16,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:16,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:16,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:16,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:16,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:19,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:19,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:19,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:19,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:19,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:19,041 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-20 10:28:19,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:19,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:19,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:19,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:19,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:21,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:28:21,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:21,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:21,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:28:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 10:28:21,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:21,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:28:21,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:21,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:21,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:28:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 10:28:24,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:24,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-01-20 10:28:24,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:24,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:28:24,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:28:24,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:28:24,888 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-01-20 10:28:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:31,252 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-01-20 10:28:31,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:28:31,252 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-01-20 10:28:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:31,253 INFO L225 Difference]: With dead ends: 101 [2019-01-20 10:28:31,253 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:28:31,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-01-20 10:28:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:28:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-20 10:28:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 10:28:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-20 10:28:31,289 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-20 10:28:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:31,289 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-20 10:28:31,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:28:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-20 10:28:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-20 10:28:31,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:31,289 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-20 10:28:31,289 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-01-20 10:28:31,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:31,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:31,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:31,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:31,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:34,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:34,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:34,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:34,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:34,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:34,322 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-20 10:28:34,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:34,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:34,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:36,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:28:36,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:36,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:36,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:28:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:36,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:36,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:28:36,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:36,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:36,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:28:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:38,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:38,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-01-20 10:28:38,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:38,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:28:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:28:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 10:28:38,109 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-01-20 10:28:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:43,077 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-20 10:28:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:28:43,077 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-01-20 10:28:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:43,078 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:28:43,078 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:28:43,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:28:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:28:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-20 10:28:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:28:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-20 10:28:43,121 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-01-20 10:28:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:43,121 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-20 10:28:43,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:28:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-20 10:28:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-20 10:28:43,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:43,122 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-01-20 10:28:43,122 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-01-20 10:28:43,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:43,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:43,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:43,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:43,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:43,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:43,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:43,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:43,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:43,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:43,715 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-20 10:28:43,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:43,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:43,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-20 10:28:43,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:43,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:43,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:44,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-01-20 10:28:44,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:44,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 10:28:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 10:28:44,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 10:28:44,758 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-01-20 10:28:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:45,370 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-01-20 10:28:45,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:28:45,370 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-01-20 10:28:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:45,371 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:28:45,371 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:28:45,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-01-20 10:28:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:28:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-20 10:28:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:28:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-20 10:28:45,411 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-01-20 10:28:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:45,412 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-20 10:28:45,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 10:28:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-20 10:28:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 10:28:45,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:45,412 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-20 10:28:45,412 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:45,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-01-20 10:28:45,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:45,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:45,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:48,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:48,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:48,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:48,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:48,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:48,186 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-20 10:28:48,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:48,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:48,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:48,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:48,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:50,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:28:50,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:50,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:50,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:28:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 10:28:50,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:50,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:28:50,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:50,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:50,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:28:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 10:28:54,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:54,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-01-20 10:28:54,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:54,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:28:54,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:28:54,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:28:54,266 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-01-20 10:28:59,587 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-20 10:29:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:02,630 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-20 10:29:02,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-20 10:29:02,630 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-01-20 10:29:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:02,631 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:29:02,631 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:29:02,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-01-20 10:29:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:29:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-20 10:29:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:29:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-20 10:29:02,672 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-20 10:29:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:02,672 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-20 10:29:02,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:29:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-20 10:29:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-20 10:29:02,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:02,691 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-20 10:29:02,692 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-01-20 10:29:02,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:02,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:02,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:02,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:02,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:05,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:05,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:05,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:05,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:05,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:05,390 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-20 10:29:05,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:05,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:05,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:08,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:29:08,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:08,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:08,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:29:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:08,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:08,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:29:08,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:08,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:08,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:29:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:09,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:09,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-01-20 10:29:09,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:09,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:29:09,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:29:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:29:09,590 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-01-20 10:29:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:16,053 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-20 10:29:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:29:16,053 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-01-20 10:29:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:16,054 INFO L225 Difference]: With dead ends: 108 [2019-01-20 10:29:16,054 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:29:16,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:29:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:29:16,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-20 10:29:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-20 10:29:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-01-20 10:29:16,094 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-01-20 10:29:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:16,095 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-01-20 10:29:16,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:29:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-01-20 10:29:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-20 10:29:16,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:16,095 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-01-20 10:29:16,096 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:16,096 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-01-20 10:29:16,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:16,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:16,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:16,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:16,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:17,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:17,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:17,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:17,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:17,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:17,600 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-20 10:29:17,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:17,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:17,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-20 10:29:17,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:17,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:17,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:19,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:19,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-01-20 10:29:19,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:19,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-20 10:29:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-20 10:29:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-01-20 10:29:19,119 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-01-20 10:29:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:19,776 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-20 10:29:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:29:19,776 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-01-20 10:29:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:19,777 INFO L225 Difference]: With dead ends: 75 [2019-01-20 10:29:19,777 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:29:19,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:29:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:29:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-20 10:29:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:29:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-20 10:29:19,818 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-01-20 10:29:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:19,818 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-20 10:29:19,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-20 10:29:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-20 10:29:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 10:29:19,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:19,819 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-20 10:29:19,819 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-01-20 10:29:19,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:19,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:19,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:19,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:22,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:22,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:22,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:22,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:22,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:22,604 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-20 10:29:22,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:22,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:22,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:22,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:22,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:25,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:29:25,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:25,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:25,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:29:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 10:29:26,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:26,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:29:26,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:26,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:26,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:29:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 10:29:29,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:29,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-01-20 10:29:29,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:29,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:29:29,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:29:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:29:29,711 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-01-20 10:29:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:37,790 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-20 10:29:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-20 10:29:37,790 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-01-20 10:29:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:37,791 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:29:37,791 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:29:37,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:29:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:29:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-20 10:29:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:29:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-20 10:29:37,833 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-20 10:29:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:37,833 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-20 10:29:37,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:29:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-20 10:29:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-20 10:29:37,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:37,834 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-20 10:29:37,834 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-01-20 10:29:37,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:37,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:37,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:40,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:40,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:40,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:40,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:40,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:40,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:29:40,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:40,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:41,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:44,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:29:44,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:44,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:44,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:29:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:44,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:44,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:29:44,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:44,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:44,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:29:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:45,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:45,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-01-20 10:29:45,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:45,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-20 10:29:45,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-20 10:29:45,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 10:29:45,570 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-01-20 10:29:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:52,391 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-01-20 10:29:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:29:52,391 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-01-20 10:29:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:52,392 INFO L225 Difference]: With dead ends: 114 [2019-01-20 10:29:52,392 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:29:52,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:29:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:29:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-20 10:29:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 10:29:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-01-20 10:29:52,438 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-01-20 10:29:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:52,439 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-01-20 10:29:52,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-20 10:29:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-01-20 10:29:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-20 10:29:52,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:52,439 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-01-20 10:29:52,440 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-01-20 10:29:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:52,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:52,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:53,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:53,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:53,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:53,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:53,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:53,494 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-20 10:29:53,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:53,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:53,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-20 10:29:53,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:53,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:53,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:55,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:55,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-01-20 10:29:55,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:55,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-20 10:29:55,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-20 10:29:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-01-20 10:29:55,071 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-01-20 10:29:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:55,812 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-01-20 10:29:55,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:29:55,812 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-01-20 10:29:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:55,813 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:29:55,813 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:29:55,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-01-20 10:29:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:29:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-20 10:29:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:29:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-20 10:29:55,877 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-01-20 10:29:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:55,878 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-20 10:29:55,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-20 10:29:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-20 10:29:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 10:29:55,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:55,879 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-20 10:29:55,879 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:55,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:55,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-01-20 10:29:55,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:55,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:55,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:59,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:59,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:59,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:59,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:59,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:59,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 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-20 10:29:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:59,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:59,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:59,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:59,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:02,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:30:02,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:02,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:02,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:30:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 10:30:03,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:03,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:30:03,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:03,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:03,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:30:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 10:30:06,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:06,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-01-20 10:30:06,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:06,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-20 10:30:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-20 10:30:07,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:30:07,000 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-01-20 10:30:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:16,630 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-01-20 10:30:16,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-20 10:30:16,631 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-01-20 10:30:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:16,632 INFO L225 Difference]: With dead ends: 119 [2019-01-20 10:30:16,632 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 10:30:16,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-01-20 10:30:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 10:30:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-20 10:30:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-20 10:30:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-20 10:30:16,697 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-20 10:30:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:16,698 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-20 10:30:16,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-20 10:30:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-20 10:30:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-20 10:30:16,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:16,699 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-20 10:30:16,699 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-01-20 10:30:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:16,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:16,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:20,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:20,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:20,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:20,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:20,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:20,987 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-20 10:30:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:20,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:30:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:21,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:24,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:30:24,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:24,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:24,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:30:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:24,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:24,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:30:24,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:24,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:24,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:30:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:25,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-01-20 10:30:25,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:25,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-20 10:30:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-20 10:30:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:30:25,826 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-01-20 10:30:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:34,050 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-01-20 10:30:34,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:30:34,051 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-01-20 10:30:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:34,052 INFO L225 Difference]: With dead ends: 120 [2019-01-20 10:30:34,052 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:30:34,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:30:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:30:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-20 10:30:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 10:30:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-20 10:30:34,109 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-01-20 10:30:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:34,109 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-20 10:30:34,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-20 10:30:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-20 10:30:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-20 10:30:34,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:34,110 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-01-20 10:30:34,110 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:34,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-01-20 10:30:34,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:34,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:34,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:35,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:35,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:35,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:35,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:35,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:35,742 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-20 10:30:35,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:35,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:36,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 10:30:36,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:36,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:36,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:37,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:37,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-01-20 10:30:37,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:37,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 10:30:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 10:30:37,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 10:30:37,353 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-01-20 10:30:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:38,180 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-01-20 10:30:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:30:38,181 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-01-20 10:30:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:38,182 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:30:38,182 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 10:30:38,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-01-20 10:30:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 10:30:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-20 10:30:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 10:30:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-20 10:30:38,233 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-01-20 10:30:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:38,234 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-20 10:30:38,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 10:30:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-20 10:30:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 10:30:38,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:38,235 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-20 10:30:38,235 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-01-20 10:30:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:38,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:38,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:41,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:41,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:41,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:41,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:41,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:41,532 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-20 10:30:41,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:41,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:41,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:41,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:41,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:47,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:30:47,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:47,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:47,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:30:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 10:30:47,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:47,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:30:47,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:47,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:47,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:30:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 10:30:52,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:52,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-01-20 10:30:52,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:52,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-20 10:30:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-20 10:30:52,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:30:52,221 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-01-20 10:31:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:02,332 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-20 10:31:02,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-01-20 10:31:02,332 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-01-20 10:31:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:02,333 INFO L225 Difference]: With dead ends: 125 [2019-01-20 10:31:02,333 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:31:02,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-01-20 10:31:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:31:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-20 10:31:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 10:31:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-20 10:31:02,399 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-20 10:31:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:02,399 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-20 10:31:02,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-20 10:31:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-20 10:31:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-20 10:31:02,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:02,400 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-20 10:31:02,400 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:02,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:02,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-01-20 10:31:02,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:02,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:02,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:05,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:05,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:05,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:05,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:05,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:05,634 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-20 10:31:05,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:05,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:05,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:09,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:31:09,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:09,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:09,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:31:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:09,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:09,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:31:09,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:09,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:09,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:31:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:10,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:10,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-01-20 10:31:10,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:10,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-20 10:31:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-20 10:31:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:31:10,998 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-01-20 10:31:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:19,903 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-01-20 10:31:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:31:19,904 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-01-20 10:31:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:19,905 INFO L225 Difference]: With dead ends: 126 [2019-01-20 10:31:19,905 INFO L226 Difference]: Without dead ends: 84 [2019-01-20 10:31:19,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:31:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-20 10:31:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-20 10:31:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:31:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-20 10:31:19,956 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-01-20 10:31:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-20 10:31:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-20 10:31:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-20 10:31:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-20 10:31:19,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:19,957 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-01-20 10:31:19,957 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-01-20 10:31:19,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:19,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:20,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:20,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:20,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:20,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:20,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:20,717 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-20 10:31:20,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:31:20,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:31:20,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-20 10:31:20,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:21,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:21,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:22,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:22,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-01-20 10:31:22,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:22,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-20 10:31:22,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-20 10:31:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-01-20 10:31:22,428 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-01-20 10:31:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:23,274 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-20 10:31:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:31:23,274 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-01-20 10:31:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:23,275 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:31:23,275 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:31:23,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-01-20 10:31:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:31:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-20 10:31:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 10:31:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-20 10:31:23,361 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-01-20 10:31:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:23,361 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-20 10:31:23,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-20 10:31:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-20 10:31:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 10:31:23,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:23,362 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-20 10:31:23,363 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:23,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-01-20 10:31:23,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:23,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:23,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:23,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:23,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:27,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:27,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:27,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:27,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:27,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:27,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 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-20 10:31:27,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:31:27,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:31:27,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:31:27,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:27,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:31,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:31:31,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:31,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:31,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:31:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 10:31:31,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:31,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:31:31,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:31,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:31,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:31:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 10:31:36,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:36,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-01-20 10:31:36,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:36,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-20 10:31:36,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-20 10:31:36,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:31:36,243 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-01-20 10:31:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:47,641 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-01-20 10:31:47,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-01-20 10:31:47,642 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-01-20 10:31:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:47,643 INFO L225 Difference]: With dead ends: 131 [2019-01-20 10:31:47,643 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:31:47,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-01-20 10:31:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:31:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-20 10:31:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 10:31:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-20 10:31:47,703 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-20 10:31:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:47,703 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-20 10:31:47,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-20 10:31:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-20 10:31:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 10:31:47,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:47,704 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-20 10:31:47,704 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-01-20 10:31:47,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:47,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:47,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:47,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:47,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:51,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:51,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:51,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:51,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:51,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:51,133 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-20 10:31:51,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:51,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:51,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:55,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:31:55,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:55,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:55,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:31:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:55,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:55,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:31:55,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:55,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:55,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:31:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:57,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:57,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-01-20 10:31:57,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:57,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-20 10:31:57,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-20 10:31:57,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:31:57,211 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-01-20 10:32:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:06,822 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-01-20 10:32:06,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:32:06,823 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-01-20 10:32:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:06,824 INFO L225 Difference]: With dead ends: 132 [2019-01-20 10:32:06,824 INFO L226 Difference]: Without dead ends: 88 [2019-01-20 10:32:06,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:32:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-20 10:32:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-20 10:32:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-20 10:32:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-01-20 10:32:06,884 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-01-20 10:32:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:06,884 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-01-20 10:32:06,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-20 10:32:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-01-20 10:32:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-20 10:32:06,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:06,885 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-01-20 10:32:06,885 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-01-20 10:32:06,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:06,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:07,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:07,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:07,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:07,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:07,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:07,996 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-20 10:32:08,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:32:08,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:32:08,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 10:32:08,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:08,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:08,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:09,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:09,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-01-20 10:32:09,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:09,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-20 10:32:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-20 10:32:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-01-20 10:32:09,922 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-01-20 10:32:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:10,850 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-01-20 10:32:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:32:10,850 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-01-20 10:32:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:10,851 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:32:10,851 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:32:10,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-01-20 10:32:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:32:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-20 10:32:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 10:32:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-20 10:32:10,911 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-01-20 10:32:10,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:10,911 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-20 10:32:10,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-20 10:32:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-20 10:32:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 10:32:10,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:10,912 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-20 10:32:10,912 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:10,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-01-20 10:32:10,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:10,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:10,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:10,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:10,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:14,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:14,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:14,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:14,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:14,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:14,769 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-20 10:32:14,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:32:14,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:32:14,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:32:14,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:14,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:19,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:32:19,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:19,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:19,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:32:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 10:32:19,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:19,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:32:19,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:19,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:19,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:32:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 10:32:24,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:24,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-01-20 10:32:24,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:24,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-20 10:32:24,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-20 10:32:24,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:32:24,953 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-01-20 10:32:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:37,353 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-01-20 10:32:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-01-20 10:32:37,354 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-01-20 10:32:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:37,354 INFO L225 Difference]: With dead ends: 137 [2019-01-20 10:32:37,354 INFO L226 Difference]: Without dead ends: 91 [2019-01-20 10:32:37,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2019-01-20 10:32:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-20 10:32:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-20 10:32:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:32:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-20 10:32:37,416 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-20 10:32:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:37,416 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-20 10:32:37,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-20 10:32:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-20 10:32:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-20 10:32:37,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:37,417 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-20 10:32:37,417 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-01-20 10:32:37,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:37,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:37,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:37,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:37,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:41,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:41,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:41,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:41,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:41,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:41,429 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-20 10:32:41,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:41,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:32:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:41,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:46,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:32:46,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:46,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:46,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:32:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:46,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:46,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:32:46,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:46,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:46,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:32:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:48,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:48,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-01-20 10:32:48,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:48,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-20 10:32:48,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-20 10:32:48,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:32:48,015 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-01-20 10:32:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:58,951 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-01-20 10:32:58,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:32:58,951 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-01-20 10:32:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:58,952 INFO L225 Difference]: With dead ends: 138 [2019-01-20 10:32:58,952 INFO L226 Difference]: Without dead ends: 92 [2019-01-20 10:32:58,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:32:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-20 10:32:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-20 10:32:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-20 10:32:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-01-20 10:32:59,017 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-01-20 10:32:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:59,017 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-01-20 10:32:59,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-20 10:32:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-01-20 10:32:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-20 10:32:59,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:59,017 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-01-20 10:32:59,017 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-01-20 10:32:59,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:59,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:59,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:59,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:59,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:59,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:59,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:59,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:59,841 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-20 10:32:59,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:32:59,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:33:00,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-20 10:33:00,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:00,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:00,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:01,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:01,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-01-20 10:33:01,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:01,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:33:01,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:33:01,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 10:33:01,746 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-01-20 10:33:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:02,741 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-01-20 10:33:02,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:33:02,741 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-01-20 10:33:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:02,742 INFO L225 Difference]: With dead ends: 95 [2019-01-20 10:33:02,742 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:33:02,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-01-20 10:33:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:33:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-20 10:33:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:33:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-20 10:33:02,804 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-01-20 10:33:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:02,804 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-20 10:33:02,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:33:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-20 10:33:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 10:33:02,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:02,805 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-20 10:33:02,805 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-01-20 10:33:02,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:02,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:02,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:07,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:07,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:07,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:07,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:07,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:07,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:07,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:33:07,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:33:07,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:33:07,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:07,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:11,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:33:11,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:11,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:11,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:33:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 10:33:11,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:12,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:33:12,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:12,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:12,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:33:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 10:33:17,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:17,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-01-20 10:33:17,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:17,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-20 10:33:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-20 10:33:17,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:33:17,796 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-01-20 10:33:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:30,845 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-01-20 10:33:30,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-01-20 10:33:30,846 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-01-20 10:33:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:30,847 INFO L225 Difference]: With dead ends: 143 [2019-01-20 10:33:30,847 INFO L226 Difference]: Without dead ends: 95 [2019-01-20 10:33:30,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-01-20 10:33:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-20 10:33:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-20 10:33:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:33:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-20 10:33:30,924 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-20 10:33:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:30,924 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-20 10:33:30,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-20 10:33:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-20 10:33:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-20 10:33:30,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:30,925 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-20 10:33:30,925 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-01-20 10:33:30,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:30,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:30,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:30,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:35,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:35,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:35,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:35,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:35,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:35,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:35,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:35,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:33:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:35,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:40,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:33:40,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:40,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:40,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:33:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:40,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:40,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:33:40,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:40,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:40,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:33:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:42,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:42,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-01-20 10:33:42,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:42,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-20 10:33:42,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-20 10:33:42,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:33:42,399 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-01-20 10:33:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:53,643 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-01-20 10:33:53,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:33:53,643 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-01-20 10:33:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:53,644 INFO L225 Difference]: With dead ends: 144 [2019-01-20 10:33:53,644 INFO L226 Difference]: Without dead ends: 96 [2019-01-20 10:33:53,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:33:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-20 10:33:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-20 10:33:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:33:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-01-20 10:33:53,713 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-01-20 10:33:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:53,713 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-01-20 10:33:53,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-20 10:33:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-01-20 10:33:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-20 10:33:53,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:53,714 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-01-20 10:33:53,714 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-01-20 10:33:53,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:53,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:53,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:53,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:53,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:54,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:54,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:54,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:54,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:54,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:54,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:54,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:33:54,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:33:55,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-20 10:33:55,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:55,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:55,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:56,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:56,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-01-20 10:33:56,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:56,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-20 10:33:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-20 10:33:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-01-20 10:33:56,716 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-01-20 10:33:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:57,851 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-01-20 10:33:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:33:57,851 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-01-20 10:33:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:57,852 INFO L225 Difference]: With dead ends: 99 [2019-01-20 10:33:57,852 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:33:57,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:33:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:33:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-20 10:33:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:33:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-20 10:33:57,923 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-01-20 10:33:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:57,923 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-20 10:33:57,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-20 10:33:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-20 10:33:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 10:33:57,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:57,924 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-20 10:33:57,924 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-01-20 10:33:57,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:57,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:57,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:57,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:02,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:02,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:02,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:02,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:02,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:02,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:02,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:34:02,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:34:02,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:34:02,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:02,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:07,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:34:07,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:07,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:07,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:34:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 10:34:07,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:07,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:34:07,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:07,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:07,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:34:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 10:34:13,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:13,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-01-20 10:34:13,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:13,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-01-20 10:34:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-01-20 10:34:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:34:13,876 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-01-20 10:34:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:28,639 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-01-20 10:34:28,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-01-20 10:34:28,639 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-01-20 10:34:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:28,640 INFO L225 Difference]: With dead ends: 149 [2019-01-20 10:34:28,640 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:34:28,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-01-20 10:34:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:34:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-20 10:34:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-20 10:34:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-20 10:34:28,728 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-20 10:34:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:28,728 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-20 10:34:28,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-01-20 10:34:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-20 10:34:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-20 10:34:28,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:28,728 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-20 10:34:28,729 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-01-20 10:34:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:28,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:28,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:33,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:33,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:33,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:33,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:33,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:33,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:33,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:33,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:34:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:33,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:38,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:34:38,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:38,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:38,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:34:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:38,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:38,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:34:38,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:39,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:39,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:34:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:41,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:41,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-01-20 10:34:41,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:41,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-20 10:34:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-20 10:34:41,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:34:41,461 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-01-20 10:34:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:52,746 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-01-20 10:34:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:34:52,746 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-01-20 10:34:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:52,747 INFO L225 Difference]: With dead ends: 150 [2019-01-20 10:34:52,747 INFO L226 Difference]: Without dead ends: 100 [2019-01-20 10:34:52,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:34:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-20 10:34:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-20 10:34:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-20 10:34:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-20 10:34:52,823 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-01-20 10:34:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:52,823 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-20 10:34:52,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-20 10:34:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-20 10:34:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-20 10:34:52,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:52,824 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-01-20 10:34:52,824 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:52,824 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-01-20 10:34:52,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:52,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:52,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:52,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:52,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:53,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:53,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:53,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:53,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:53,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:53,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:53,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:34:53,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:34:54,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 10:34:54,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:54,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:54,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:55,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:55,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-01-20 10:34:55,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:55,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-20 10:34:55,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-20 10:34:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-01-20 10:34:55,958 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-01-20 10:34:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:57,290 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-01-20 10:34:57,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:34:57,291 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-20 10:34:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:57,292 INFO L225 Difference]: With dead ends: 103 [2019-01-20 10:34:57,292 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:34:57,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-01-20 10:34:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:34:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-20 10:34:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:34:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-20 10:34:57,411 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-01-20 10:34:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:57,412 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-20 10:34:57,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-20 10:34:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-20 10:34:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 10:34:57,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:57,412 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-20 10:34:57,412 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:57,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-01-20 10:34:57,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:57,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:57,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:02,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:02,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:02,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:02,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:02,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:02,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:02,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:35:02,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:35:02,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:35:02,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:02,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:08,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:35:08,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:08,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:08,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:35:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 10:35:08,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:08,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:35:08,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:08,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:08,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:35:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 10:35:15,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:15,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-01-20 10:35:15,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-01-20 10:35:15,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-01-20 10:35:15,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:35:15,109 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-01-20 10:35:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:30,908 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-01-20 10:35:30,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-01-20 10:35:30,909 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-01-20 10:35:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:30,910 INFO L225 Difference]: With dead ends: 155 [2019-01-20 10:35:30,910 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:35:30,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-01-20 10:35:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:35:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-20 10:35:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:35:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-20 10:35:30,990 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-20 10:35:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:30,990 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-20 10:35:30,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-01-20 10:35:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-20 10:35:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-20 10:35:30,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:30,991 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-20 10:35:30,991 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-01-20 10:35:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:30,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:30,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:36,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:36,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:36,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:36,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:36,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:36,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:36,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:36,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:35:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:36,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:42,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:35:42,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:42,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:42,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-20 10:35:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:42,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:42,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:35:42,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:42,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:42,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-20 10:35:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:44,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:44,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-01-20 10:35:44,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:44,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-20 10:35:44,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-20 10:35:44,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:35:44,876 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-01-20 10:35:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:57,090 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-01-20 10:35:57,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-20 10:35:57,090 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-01-20 10:35:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:57,091 INFO L225 Difference]: With dead ends: 156 [2019-01-20 10:35:57,091 INFO L226 Difference]: Without dead ends: 104 [2019-01-20 10:35:57,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:35:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-20 10:35:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-20 10:35:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-20 10:35:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-20 10:35:57,169 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-01-20 10:35:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:57,169 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-20 10:35:57,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-20 10:35:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-20 10:35:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-20 10:35:57,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:57,170 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-01-20 10:35:57,170 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:57,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-01-20 10:35:57,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:57,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:57,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:57,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:57,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:58,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:58,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:58,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:58,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:58,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:58,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:58,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:35:58,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:35:58,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-20 10:35:58,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:58,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:58,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:00,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:00,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-01-20 10:36:00,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:00,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 10:36:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 10:36:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 10:36:00,804 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-01-20 10:36:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:02,068 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-01-20 10:36:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:36:02,068 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-01-20 10:36:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:02,069 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:36:02,069 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:36:02,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-01-20 10:36:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:36:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-20 10:36:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:36:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-20 10:36:02,155 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-01-20 10:36:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:02,155 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-20 10:36:02,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 10:36:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-20 10:36:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 10:36:02,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:02,156 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-20 10:36:02,157 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-01-20 10:36:02,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:02,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:02,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:36:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:02,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:07,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:07,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:07,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:07,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:07,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:07,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:36:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:36:07,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:36:07,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:36:07,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:36:07,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:14,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:36:14,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:14,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:14,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-20 10:36:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 10:36:14,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:14,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-20 10:36:14,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:14,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:14,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-20 10:36:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 10:36:21,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:21,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-01-20 10:36:21,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:21,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-20 10:36:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-20 10:36:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:36:21,662 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-01-20 10:36:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:37,652 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-20 10:36:37,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-01-20 10:36:37,652 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-01-20 10:36:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:37,653 INFO L225 Difference]: With dead ends: 161 [2019-01-20 10:36:37,653 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:36:37,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2019-01-20 10:36:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:36:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-20 10:36:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 10:36:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-20 10:36:37,736 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-20 10:36:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:37,736 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-20 10:36:37,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-20 10:36:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-20 10:36:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-20 10:36:37,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:37,737 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-20 10:36:37,737 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-01-20 10:36:37,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:37,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:37,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:36:37,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:37,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat