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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:57:02,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:57:02,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:57:02,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:57:02,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:57:02,344 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:57:02,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:57:02,347 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:57:02,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:57:02,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:57:02,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:57:02,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:57:02,352 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:57:02,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:57:02,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:57:02,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:57:02,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:57:02,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:57:02,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:57:02,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:57:02,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:57:02,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:57:02,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:57:02,368 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:57:02,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:57:02,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:57:02,370 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:57:02,371 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:57:02,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:57:02,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:57:02,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:57:02,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:57:02,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:57:02,375 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:57:02,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:57:02,376 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:57:02,377 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-04 11:57:02,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:57:02,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:57:02,391 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:57:02,391 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:57:02,391 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:57:02,391 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:57:02,391 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:57:02,392 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:57:02,392 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:57:02,392 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-04 11:57:02,392 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-04 11:57:02,392 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:57:02,393 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:57:02,393 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:57:02,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:57:02,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:57:02,394 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:57:02,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:57:02,394 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:57:02,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:57:02,395 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:57:02,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:57:02,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:57:02,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:57:02,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:57:02,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:57:02,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:57:02,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:57:02,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:57:02,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:57:02,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:57:02,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:57:02,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:57:02,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:57:02,398 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:57:02,398 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:57:02,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:57:02,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:57:02,398 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:57:02,398 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:57:02,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:57:02,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:57:02,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:57:02,466 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:57:02,466 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:57:02,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-12-04 11:57:02,467 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-12-04 11:57:02,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:57:02,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:57:02,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:02,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:57:02,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:57:02,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,553 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-04 11:57:02,554 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-04 11:57:02,554 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-04 11:57:02,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:02,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:57:02,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:57:02,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:57:02,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:57:02,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:57:02,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:57:02,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:57:02,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:57:02,668 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-04 11:57:02,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-04 11:57:02,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-04 11:57:02,901 INFO L272 CfgBuilder]: Using library mode [2018-12-04 11:57:02,901 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-04 11:57:02,902 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:02 BoogieIcfgContainer [2018-12-04 11:57:02,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:57:02,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:57:02,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:57:02,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:57:02,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/2) ... [2018-12-04 11:57:02,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2c8fe5 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:57:02, skipping insertion in model container [2018-12-04 11:57:02,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:02" (2/2) ... [2018-12-04 11:57:02,911 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-12-04 11:57:02,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:57:02,934 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:57:02,955 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:57:03,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:57:03,001 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:57:03,001 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:57:03,001 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:57:03,001 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:57:03,002 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:57:03,002 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:57:03,002 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:57:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-04 11:57:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-04 11:57:03,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-04 11:57:03,042 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-04 11:57:03,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:03,662 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-12-04 11:57:03,850 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-04 11:57:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:03,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:57:03,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:57:03,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:57:03,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:57:03,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:57:03,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:57:03,874 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-12-04 11:57:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:04,003 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-04 11:57:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:57:04,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-04 11:57:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:04,017 INFO L225 Difference]: With dead ends: 14 [2018-12-04 11:57:04,018 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:57:04,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:57:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:57:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-04 11:57:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-04 11:57:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-04 11:57:04,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-04 11:57:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:04,059 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-04 11:57:04,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:57:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-04 11:57:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-04 11:57:04,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:04,061 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-04 11:57:04,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:04,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-04 11:57:04,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:04,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:04,331 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:04,862 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-04 11:57:05,035 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-04 11:57:05,193 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-04 11:57:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:05,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:05,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:05,196 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-04 11:57:05,198 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-04 11:57:05,260 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 11:57:05,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:57:06,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:57:06,969 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 21 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-04 11:57:06,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:06,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:57:06,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:06,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:06,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:06,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:07,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:07,146 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 [2018-12-04 11:57:07,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:07,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:07,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:07,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:07,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:07,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:07,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:07,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:08,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:08,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-04 11:57:08,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:08,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-04 11:57:08,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-04 11:57:08,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-04 11:57:08,028 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-12-04 11:57:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:08,081 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-04 11:57:08,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:57:08,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-04 11:57:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:08,085 INFO L225 Difference]: With dead ends: 10 [2018-12-04 11:57:08,085 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:57:08,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-04 11:57:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:57:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-04 11:57:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-04 11:57:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-04 11:57:08,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-04 11:57:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:08,090 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-04 11:57:08,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-04 11:57:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-04 11:57:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-04 11:57:08,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:08,091 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-04 11:57:08,091 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:08,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:08,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-04 11:57:08,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:08,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:08,427 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-12-04 11:57:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:08,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:08,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:08,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:08,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:08,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:08,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:08,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:08,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:08,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-04 11:57:08,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:08,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:08,489 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 [2018-12-04 11:57:08,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:08,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:08,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:08,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:08,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:08,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:08,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:08,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:09,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-04 11:57:09,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:09,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:57:09,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:57:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:57:09,174 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-12-04 11:57:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:09,274 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-04 11:57:09,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:57:09,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-04 11:57:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:09,275 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:57:09,275 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:57:09,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:57:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:57:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-04 11:57:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-04 11:57:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-04 11:57:09,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-04 11:57:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:09,279 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-04 11:57:09,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:57:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-04 11:57:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:57:09,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:09,280 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-04 11:57:09,280 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:09,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-04 11:57:09,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:09,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:09,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:09,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:09,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:09,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:09,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:09,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:09,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:09,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:09,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:09,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:09,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:09,579 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 [2018-12-04 11:57:09,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:09,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:09,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:09,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:09,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:09,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:09,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:09,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-04 11:57:09,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:09,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-04 11:57:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-04 11:57:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-12-04 11:57:09,857 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-12-04 11:57:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:10,002 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-04 11:57:10,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:57:10,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-12-04 11:57:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:10,004 INFO L225 Difference]: With dead ends: 14 [2018-12-04 11:57:10,004 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:57:10,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-12-04 11:57:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:57:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-04 11:57:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-04 11:57:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-04 11:57:10,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-04 11:57:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:10,008 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-04 11:57:10,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-04 11:57:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-04 11:57:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-04 11:57:10,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:10,009 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-04 11:57:10,009 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:10,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-04 11:57:10,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:10,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:10,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:10,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:10,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:10,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:10,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:10,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:10,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:10,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:10,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:10,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:10,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:10,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:10,374 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 [2018-12-04 11:57:10,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:10,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:10,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:10,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:10,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:10,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:10,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:10,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:10,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:10,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2018-12-04 11:57:10,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:10,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-04 11:57:10,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-04 11:57:10,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:57:10,822 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-12-04 11:57:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:10,918 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-04 11:57:10,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:57:10,919 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-12-04 11:57:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:10,920 INFO L225 Difference]: With dead ends: 16 [2018-12-04 11:57:10,920 INFO L226 Difference]: Without dead ends: 15 [2018-12-04 11:57:10,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:57:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-04 11:57:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-04 11:57:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-04 11:57:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-04 11:57:10,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-04 11:57:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:10,926 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-04 11:57:10,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-04 11:57:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-04 11:57:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-04 11:57:10,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:10,927 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-04 11:57:10,927 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:10,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-04 11:57:10,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:10,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:10,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:10,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:11,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:11,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:11,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:11,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:11,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:11,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:11,268 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:11,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-04 11:57:11,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:11,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:11,288 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 [2018-12-04 11:57:11,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:11,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:11,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:11,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:11,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:11,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:11,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:11,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2018-12-04 11:57:11,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:57:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:57:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-12-04 11:57:11,871 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-12-04 11:57:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:12,113 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-04 11:57:12,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:57:12,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-12-04 11:57:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:12,114 INFO L225 Difference]: With dead ends: 18 [2018-12-04 11:57:12,114 INFO L226 Difference]: Without dead ends: 17 [2018-12-04 11:57:12,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-12-04 11:57:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-04 11:57:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-04 11:57:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-04 11:57:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-04 11:57:12,119 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-04 11:57:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:12,119 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-04 11:57:12,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:57:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-04 11:57:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-04 11:57:12,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:12,120 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-04 11:57:12,121 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:12,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-04 11:57:12,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:12,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:12,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:12,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:12,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:12,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:12,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:12,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:12,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:12,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:12,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:12,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:12,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:12,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:12,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:12,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:12,454 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 [2018-12-04 11:57:12,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:12,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:12,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:12,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:12,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:12,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:12,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:12,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:13,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:13,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2018-12-04 11:57:13,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:13,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-04 11:57:13,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-04 11:57:13,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:57:13,084 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-12-04 11:57:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:13,333 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-04 11:57:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:57:13,334 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-12-04 11:57:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:13,335 INFO L225 Difference]: With dead ends: 20 [2018-12-04 11:57:13,335 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:57:13,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:57:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:57:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-04 11:57:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-04 11:57:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-04 11:57:13,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-04 11:57:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:13,340 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-04 11:57:13,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-04 11:57:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-04 11:57:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-04 11:57:13,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:13,341 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-04 11:57:13,341 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:13,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:13,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-04 11:57:13,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:13,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:13,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:13,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:13,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:13,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:13,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:13,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:13,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:13,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:13,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:13,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:13,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:13,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:13,730 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 [2018-12-04 11:57:13,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:13,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:13,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:13,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:13,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:14,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:14,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:14,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:14,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:14,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2018-12-04 11:57:14,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:14,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-04 11:57:14,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-04 11:57:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-12-04 11:57:14,353 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-12-04 11:57:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:14,860 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-04 11:57:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 11:57:14,861 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-12-04 11:57:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:14,862 INFO L225 Difference]: With dead ends: 22 [2018-12-04 11:57:14,862 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:57:14,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-12-04 11:57:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:57:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-04 11:57:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-04 11:57:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-04 11:57:14,866 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-04 11:57:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:14,867 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-04 11:57:14,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-04 11:57:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-04 11:57:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-04 11:57:14,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:14,868 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-04 11:57:14,868 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:14,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-04 11:57:14,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:14,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:14,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:15,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:15,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:15,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:15,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:15,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:15,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:15,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:15,263 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:15,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-04 11:57:15,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:15,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:15,281 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 [2018-12-04 11:57:15,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:15,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:15,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:15,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:15,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:15,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:15,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:15,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:16,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:16,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2018-12-04 11:57:16,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:16,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:57:16,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:57:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:57:16,023 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-12-04 11:57:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:16,341 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-04 11:57:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-04 11:57:16,342 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-12-04 11:57:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:16,343 INFO L225 Difference]: With dead ends: 24 [2018-12-04 11:57:16,343 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:57:16,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:57:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:57:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-04 11:57:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-04 11:57:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-04 11:57:16,350 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-04 11:57:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:16,350 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-04 11:57:16,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:57:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-04 11:57:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-04 11:57:16,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:16,351 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-04 11:57:16,351 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:16,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:16,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-04 11:57:16,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:16,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:16,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:16,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:16,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:16,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:16,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:16,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:16,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:16,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:16,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:16,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:16,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:16,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:16,774 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 [2018-12-04 11:57:16,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:16,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:16,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:17,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:17,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:17,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:17,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:17,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:17,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:17,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2018-12-04 11:57:17,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:17,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-04 11:57:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-04 11:57:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-12-04 11:57:17,750 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-12-04 11:57:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:18,160 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-04 11:57:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-04 11:57:18,160 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-12-04 11:57:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:18,161 INFO L225 Difference]: With dead ends: 26 [2018-12-04 11:57:18,161 INFO L226 Difference]: Without dead ends: 25 [2018-12-04 11:57:18,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-12-04 11:57:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-04 11:57:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-04 11:57:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-04 11:57:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-04 11:57:18,168 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-04 11:57:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:18,168 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-04 11:57:18,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-04 11:57:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-04 11:57:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-04 11:57:18,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:18,169 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-04 11:57:18,169 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:18,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:18,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-04 11:57:18,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:18,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:18,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:18,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:18,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:18,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:18,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:18,701 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:18,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:18,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:18,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:18,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:18,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:18,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:18,727 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 [2018-12-04 11:57:18,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:18,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:18,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:19,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:19,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:19,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:19,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:19,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:19,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:19,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2018-12-04 11:57:19,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:19,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:57:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:57:19,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:57:19,598 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-12-04 11:57:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:19,904 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-04 11:57:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:57:19,905 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-12-04 11:57:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:19,906 INFO L225 Difference]: With dead ends: 28 [2018-12-04 11:57:19,906 INFO L226 Difference]: Without dead ends: 27 [2018-12-04 11:57:19,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:57:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-04 11:57:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-04 11:57:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-04 11:57:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-04 11:57:19,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-04 11:57:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:19,913 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-04 11:57:19,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:57:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-04 11:57:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-04 11:57:19,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:19,915 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-04 11:57:19,915 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:19,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:19,915 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-04 11:57:19,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:19,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:19,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:20,291 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:20,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:20,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:20,740 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:20,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:20,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:20,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:20,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:20,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:20,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-04 11:57:20,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:20,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:20,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 [2018-12-04 11:57:20,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:20,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:20,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:21,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:21,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:21,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:21,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:21,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:21,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:21,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2018-12-04 11:57:21,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:21,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:57:21,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:57:21,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-12-04 11:57:21,732 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-12-04 11:57:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:22,196 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-04 11:57:22,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 11:57:22,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-12-04 11:57:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:22,202 INFO L225 Difference]: With dead ends: 30 [2018-12-04 11:57:22,202 INFO L226 Difference]: Without dead ends: 29 [2018-12-04 11:57:22,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-12-04 11:57:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-04 11:57:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-04 11:57:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-04 11:57:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-04 11:57:22,207 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-04 11:57:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:22,207 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-04 11:57:22,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:57:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-04 11:57:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-04 11:57:22,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:22,209 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-04 11:57:22,209 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:22,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-04 11:57:22,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:22,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:22,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:22,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:22,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:22,740 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:22,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:22,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:22,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:22,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:22,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:22,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:22,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:22,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:22,772 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 [2018-12-04 11:57:22,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:22,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:22,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:23,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:23,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:23,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:23,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:23,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:23,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:23,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2018-12-04 11:57:23,696 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:23,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-04 11:57:23,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-04 11:57:23,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:57:23,697 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-12-04 11:57:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:24,132 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-04 11:57:24,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-04 11:57:24,133 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-12-04 11:57:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:24,134 INFO L225 Difference]: With dead ends: 32 [2018-12-04 11:57:24,134 INFO L226 Difference]: Without dead ends: 31 [2018-12-04 11:57:24,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:57:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-04 11:57:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-04 11:57:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-04 11:57:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-04 11:57:24,141 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-04 11:57:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:24,141 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-04 11:57:24,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-04 11:57:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-04 11:57:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-04 11:57:24,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:24,142 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-04 11:57:24,142 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:24,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:24,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-04 11:57:24,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:24,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:24,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:24,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:24,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:24,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:24,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:24,805 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:24,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:24,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:24,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:24,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:24,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:24,829 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 [2018-12-04 11:57:24,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:24,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:24,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:25,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:25,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:25,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:25,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:25,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:26,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:26,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2018-12-04 11:57:26,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:26,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-04 11:57:26,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-04 11:57:26,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2018-12-04 11:57:26,264 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-12-04 11:57:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:27,087 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-04 11:57:27,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 11:57:27,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-12-04 11:57:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:27,089 INFO L225 Difference]: With dead ends: 34 [2018-12-04 11:57:27,089 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:57:27,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2018-12-04 11:57:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:57:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-04 11:57:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-04 11:57:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-04 11:57:27,096 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-04 11:57:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:27,097 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-04 11:57:27,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-04 11:57:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-04 11:57:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-04 11:57:27,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:27,098 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-04 11:57:27,098 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:27,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-04 11:57:27,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:27,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:27,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:27,367 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:27,590 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-04 11:57:27,792 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:28,574 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-04 11:57:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:28,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:28,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:28,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:28,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:28,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:28,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:28,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:28,587 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:28,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-04 11:57:28,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:28,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:28,625 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 [2018-12-04 11:57:28,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:28,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:28,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:29,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:29,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:29,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:29,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:29,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:30,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:30,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2018-12-04 11:57:30,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:30,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:57:30,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:57:30,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:57:30,300 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-12-04 11:57:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:30,955 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-04 11:57:30,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:57:30,956 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-12-04 11:57:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:30,957 INFO L225 Difference]: With dead ends: 36 [2018-12-04 11:57:30,957 INFO L226 Difference]: Without dead ends: 35 [2018-12-04 11:57:30,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:57:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-04 11:57:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-04 11:57:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-04 11:57:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-04 11:57:30,963 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-04 11:57:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:30,964 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-04 11:57:30,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:57:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-04 11:57:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-04 11:57:30,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:30,965 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-04 11:57:30,965 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:30,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-04 11:57:30,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:31,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:31,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:31,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:31,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:31,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:31,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:31,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:31,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:31,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:31,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:31,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:31,597 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 [2018-12-04 11:57:31,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:31,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:31,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:32,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:32,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:32,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:32,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:32,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:34,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:34,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2018-12-04 11:57:34,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:34,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-04 11:57:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-04 11:57:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2018-12-04 11:57:34,051 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-12-04 11:57:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:34,535 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-04 11:57:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:57:34,536 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-12-04 11:57:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:34,537 INFO L225 Difference]: With dead ends: 38 [2018-12-04 11:57:34,537 INFO L226 Difference]: Without dead ends: 37 [2018-12-04 11:57:34,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2018-12-04 11:57:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-04 11:57:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-04 11:57:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-04 11:57:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-04 11:57:34,544 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-04 11:57:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:34,544 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-04 11:57:34,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-04 11:57:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-04 11:57:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-04 11:57:34,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:34,545 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-04 11:57:34,545 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:34,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-04 11:57:34,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:34,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:34,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:34,812 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:35,048 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-04 11:57:35,323 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:35,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:35,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:35,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:35,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:35,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:35,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:35,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:35,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:35,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:35,949 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 [2018-12-04 11:57:35,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:35,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:35,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:36,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:36,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:36,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:36,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:36,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:37,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:37,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2018-12-04 11:57:37,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:37,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-04 11:57:37,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-04 11:57:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:57:37,754 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-12-04 11:57:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:38,655 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-04 11:57:38,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-04 11:57:38,656 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-12-04 11:57:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:38,656 INFO L225 Difference]: With dead ends: 40 [2018-12-04 11:57:38,656 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:57:38,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:57:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:57:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-04 11:57:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-04 11:57:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-04 11:57:38,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-04 11:57:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:38,664 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-04 11:57:38,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-04 11:57:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-04 11:57:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-04 11:57:38,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:38,665 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-04 11:57:38,665 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:38,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-04 11:57:38,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:38,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:38,944 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 11:57:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:39,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:39,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:39,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:39,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:39,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:39,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:39,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:39,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:39,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-04 11:57:39,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:39,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:39,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 [2018-12-04 11:57:39,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:39,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:39,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:40,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:40,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:40,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:40,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:40,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:41,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:41,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2018-12-04 11:57:41,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:41,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:57:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:57:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2018-12-04 11:57:41,361 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-12-04 11:57:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:42,209 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-04 11:57:42,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 11:57:42,212 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-12-04 11:57:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:42,213 INFO L225 Difference]: With dead ends: 42 [2018-12-04 11:57:42,213 INFO L226 Difference]: Without dead ends: 41 [2018-12-04 11:57:42,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2018-12-04 11:57:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-04 11:57:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-04 11:57:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-04 11:57:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-04 11:57:42,219 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-04 11:57:42,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:42,219 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-04 11:57:42,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:57:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-04 11:57:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-04 11:57:42,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:42,220 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-04 11:57:42,220 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:42,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:42,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-04 11:57:42,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:42,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:42,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:42,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:42,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:43,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:43,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:43,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:43,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:43,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:43,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:43,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:43,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:43,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:43,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:43,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:43,289 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 [2018-12-04 11:57:43,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:43,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:43,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:43,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:43,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:43,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:43,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:43,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:45,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:45,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2018-12-04 11:57:45,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:45,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-04 11:57:45,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-04 11:57:45,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:57:45,009 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-12-04 11:57:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:46,022 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-04 11:57:46,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-04 11:57:46,023 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-12-04 11:57:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:46,024 INFO L225 Difference]: With dead ends: 44 [2018-12-04 11:57:46,024 INFO L226 Difference]: Without dead ends: 43 [2018-12-04 11:57:46,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:57:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-04 11:57:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-04 11:57:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-04 11:57:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-04 11:57:46,029 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-04 11:57:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:46,029 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-04 11:57:46,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-04 11:57:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-04 11:57:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-04 11:57:46,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:46,030 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-04 11:57:46,030 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:46,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-04 11:57:46,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:46,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:46,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:46,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:46,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:46,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:46,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:46,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:46,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:46,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:46,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:46,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:46,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:46,949 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 [2018-12-04 11:57:46,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:46,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:46,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:47,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:47,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:47,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:47,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:47,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:49,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2018-12-04 11:57:49,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:49,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-04 11:57:49,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-04 11:57:49,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2018-12-04 11:57:49,054 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-12-04 11:57:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:49,922 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-04 11:57:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:57:49,922 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-12-04 11:57:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:49,923 INFO L225 Difference]: With dead ends: 46 [2018-12-04 11:57:49,923 INFO L226 Difference]: Without dead ends: 45 [2018-12-04 11:57:49,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2018-12-04 11:57:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-04 11:57:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-04 11:57:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-04 11:57:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-04 11:57:49,929 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-04 11:57:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:49,930 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-04 11:57:49,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-04 11:57:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-04 11:57:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-04 11:57:49,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:49,931 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-04 11:57:49,931 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:49,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-04 11:57:49,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:49,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:49,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:49,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:50,121 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:50,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:50,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:50,779 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:50,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:50,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:50,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:50,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:50,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:50,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-04 11:57:50,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:50,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:50,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 [2018-12-04 11:57:50,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:50,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:50,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:51,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:51,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:51,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:51,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:51,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:53,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:53,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2018-12-04 11:57:53,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:53,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:57:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:57:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:57:53,100 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-12-04 11:57:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:53,980 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-04 11:57:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-04 11:57:53,981 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-12-04 11:57:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:53,981 INFO L225 Difference]: With dead ends: 48 [2018-12-04 11:57:53,981 INFO L226 Difference]: Without dead ends: 47 [2018-12-04 11:57:53,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:57:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-04 11:57:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-04 11:57:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-04 11:57:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-04 11:57:53,988 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-04 11:57:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:53,989 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-04 11:57:53,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:57:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-04 11:57:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-04 11:57:53,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:53,990 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-04 11:57:53,990 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:53,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-04 11:57:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:53,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:53,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:54,184 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:54,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:54,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:54,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:54,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:54,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:54,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:57:54,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:54,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:54,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:54,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:54,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:54,870 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 [2018-12-04 11:57:54,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:54,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:54,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:57:55,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:57:55,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:57:55,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:57:55,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:57:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:55,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:57,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:57,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2018-12-04 11:57:57,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:57,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-04 11:57:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-04 11:57:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2018-12-04 11:57:57,297 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-12-04 11:57:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:58,555 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-04 11:57:58,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:57:58,558 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-12-04 11:57:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:58,559 INFO L225 Difference]: With dead ends: 50 [2018-12-04 11:57:58,559 INFO L226 Difference]: Without dead ends: 49 [2018-12-04 11:57:58,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2018-12-04 11:57:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-04 11:57:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-04 11:57:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-04 11:57:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-04 11:57:58,563 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-04 11:57:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:58,564 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-04 11:57:58,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-04 11:57:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-04 11:57:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-04 11:57:58,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:58,565 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-04 11:57:58,565 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:58,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-04 11:57:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:58,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:58,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:58,833 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 11:57:59,087 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:57:59,357 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 11:58:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:00,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:00,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:00,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:00,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:00,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:00,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:00,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:00,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:00,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:00,174 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 [2018-12-04 11:58:00,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:00,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:00,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:01,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:01,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:01,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:01,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:01,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:02,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:02,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2018-12-04 11:58:02,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:02,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-04 11:58:02,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-04 11:58:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:58:02,534 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-12-04 11:58:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:03,850 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-04 11:58:03,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:58:03,851 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-12-04 11:58:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:03,851 INFO L225 Difference]: With dead ends: 52 [2018-12-04 11:58:03,852 INFO L226 Difference]: Without dead ends: 51 [2018-12-04 11:58:03,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:58:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-04 11:58:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-04 11:58:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-04 11:58:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-04 11:58:03,857 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-04 11:58:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:03,858 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-04 11:58:03,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-04 11:58:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-04 11:58:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-04 11:58:03,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:03,858 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-04 11:58:03,859 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:03,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:03,859 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-04 11:58:03,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:03,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:03,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:03,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:03,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:04,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:04,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:04,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:04,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:04,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:04,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:04,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:04,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:04,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-04 11:58:04,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:04,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:04,775 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 [2018-12-04 11:58:04,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:04,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:04,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:05,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:05,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:05,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:05,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:05,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:07,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:07,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2018-12-04 11:58:07,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:07,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:58:07,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:58:07,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2018-12-04 11:58:07,339 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-12-04 11:58:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:08,915 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-04 11:58:08,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-04 11:58:08,916 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-12-04 11:58:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:08,917 INFO L225 Difference]: With dead ends: 54 [2018-12-04 11:58:08,917 INFO L226 Difference]: Without dead ends: 53 [2018-12-04 11:58:08,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2018-12-04 11:58:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-04 11:58:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-04 11:58:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-04 11:58:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-04 11:58:08,924 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-04 11:58:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:08,924 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-04 11:58:08,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:58:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-04 11:58:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-04 11:58:08,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:08,925 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-04 11:58:08,926 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:08,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-04 11:58:08,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:08,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:08,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:09,191 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 11:58:09,434 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:58:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:10,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:10,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:10,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:10,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:10,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:10,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:10,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:10,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:10,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:10,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:10,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:10,315 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 [2018-12-04 11:58:10,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:10,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:10,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:11,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:11,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:11,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:11,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:11,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:13,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:13,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2018-12-04 11:58:13,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:13,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:58:13,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:58:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:58:13,896 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-12-04 11:58:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:15,115 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-04 11:58:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-04 11:58:15,116 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-12-04 11:58:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:15,117 INFO L225 Difference]: With dead ends: 56 [2018-12-04 11:58:15,117 INFO L226 Difference]: Without dead ends: 55 [2018-12-04 11:58:15,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:58:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-04 11:58:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-04 11:58:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-04 11:58:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-04 11:58:15,122 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-04 11:58:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:15,122 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-04 11:58:15,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:58:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-04 11:58:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-04 11:58:15,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:15,123 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-04 11:58:15,124 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:15,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-04 11:58:15,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:15,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:15,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:15,349 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:58:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:16,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:16,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:16,173 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:16,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:16,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:16,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:16,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:16,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:16,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:16,237 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 [2018-12-04 11:58:16,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:16,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:16,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:17,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:17,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:17,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:17,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:17,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:19,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:19,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2018-12-04 11:58:19,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:19,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-04 11:58:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-04 11:58:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2018-12-04 11:58:19,312 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-12-04 11:58:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:20,589 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-04 11:58:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 11:58:20,590 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-12-04 11:58:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:20,591 INFO L225 Difference]: With dead ends: 58 [2018-12-04 11:58:20,591 INFO L226 Difference]: Without dead ends: 57 [2018-12-04 11:58:20,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2018-12-04 11:58:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-04 11:58:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-04 11:58:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-04 11:58:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-04 11:58:20,597 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-04 11:58:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:20,597 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-04 11:58:20,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-04 11:58:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-04 11:58:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-04 11:58:20,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:20,598 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-04 11:58:20,598 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:20,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:20,599 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-04 11:58:20,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:20,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:20,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:20,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:21,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:21,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:21,694 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:21,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:21,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:21,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:21,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:21,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:21,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-04 11:58:21,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:21,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:21,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 [2018-12-04 11:58:21,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:21,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:21,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:22,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:22,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:22,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:22,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:22,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:25,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:25,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2018-12-04 11:58:25,083 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:25,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 11:58:25,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 11:58:25,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:58:25,085 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-12-04 11:58:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:26,905 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-04 11:58:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:58:26,906 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-12-04 11:58:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:26,907 INFO L225 Difference]: With dead ends: 60 [2018-12-04 11:58:26,907 INFO L226 Difference]: Without dead ends: 59 [2018-12-04 11:58:26,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:58:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-04 11:58:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-04 11:58:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-04 11:58:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-04 11:58:26,913 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-04 11:58:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:26,913 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-04 11:58:26,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 11:58:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-04 11:58:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-04 11:58:26,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:26,914 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-04 11:58:26,914 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:26,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-04 11:58:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:26,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:26,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:28,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:28,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:28,050 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:28,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:28,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:28,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:28,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:28,060 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:28,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:28,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:28,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:28,081 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 [2018-12-04 11:58:28,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:28,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:28,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:29,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:29,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:29,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:29,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:29,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:31,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:31,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2018-12-04 11:58:31,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:31,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-04 11:58:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-04 11:58:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2018-12-04 11:58:31,630 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-12-04 11:58:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:33,117 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-04 11:58:33,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:58:33,118 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-12-04 11:58:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:33,119 INFO L225 Difference]: With dead ends: 62 [2018-12-04 11:58:33,119 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:58:33,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2018-12-04 11:58:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:58:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-12-04 11:58:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-04 11:58:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-04 11:58:33,122 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-04 11:58:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:33,123 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-04 11:58:33,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-04 11:58:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-04 11:58:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-04 11:58:33,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:33,123 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-04 11:58:33,124 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:33,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:33,124 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-04 11:58:33,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:33,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:33,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:33,364 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:58:33,584 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-04 11:58:33,842 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:58:34,130 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:58:34,431 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:58:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:35,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:35,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:35,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:35,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:35,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:35,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:35,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:35,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:35,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:35,582 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 [2018-12-04 11:58:35,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:35,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:35,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:36,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:36,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:36,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:36,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:36,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:39,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:39,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2018-12-04 11:58:39,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:39,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-04 11:58:39,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-04 11:58:39,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:58:39,340 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-12-04 11:58:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:40,835 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-04 11:58:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-04 11:58:40,836 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-12-04 11:58:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:40,836 INFO L225 Difference]: With dead ends: 64 [2018-12-04 11:58:40,837 INFO L226 Difference]: Without dead ends: 63 [2018-12-04 11:58:40,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:58:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-04 11:58:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-12-04 11:58:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-04 11:58:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-04 11:58:40,841 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-04 11:58:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:40,842 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-04 11:58:40,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-04 11:58:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-04 11:58:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-04 11:58:40,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:40,843 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-04 11:58:40,843 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:40,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:40,843 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-04 11:58:40,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:40,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:40,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:40,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:40,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:41,015 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:58:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:42,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:42,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:42,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:42,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:42,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:42,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:42,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:42,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:42,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-04 11:58:42,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:42,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:42,081 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 [2018-12-04 11:58:42,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:42,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:42,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:43,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:43,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:43,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:43,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:43,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:46,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:46,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2018-12-04 11:58:46,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:46,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 11:58:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 11:58:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2018-12-04 11:58:46,054 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-12-04 11:58:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:47,979 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-04 11:58:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 11:58:47,980 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-12-04 11:58:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:47,981 INFO L225 Difference]: With dead ends: 66 [2018-12-04 11:58:47,981 INFO L226 Difference]: Without dead ends: 65 [2018-12-04 11:58:47,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2018-12-04 11:58:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-04 11:58:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-04 11:58:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-04 11:58:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-04 11:58:47,987 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-04 11:58:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:47,987 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-04 11:58:47,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 11:58:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-04 11:58:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-04 11:58:47,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:47,988 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-04 11:58:47,988 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:47,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:47,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-04 11:58:47,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:47,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:47,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:47,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:47,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:48,267 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 11:58:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:49,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:49,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:49,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:49,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:49,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:49,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:49,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:49,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:49,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:49,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:49,663 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 [2018-12-04 11:58:49,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:49,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:49,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:51,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:51,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:51,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:51,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:51,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:53,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2018-12-04 11:58:53,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:53,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-04 11:58:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-04 11:58:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:58:53,746 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-12-04 11:58:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:55,613 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-04 11:58:55,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:58:55,614 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-12-04 11:58:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:55,615 INFO L225 Difference]: With dead ends: 68 [2018-12-04 11:58:55,615 INFO L226 Difference]: Without dead ends: 67 [2018-12-04 11:58:55,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:58:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-04 11:58:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-04 11:58:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-04 11:58:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-04 11:58:55,620 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-04 11:58:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:55,620 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-04 11:58:55,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-04 11:58:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-04 11:58:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-04 11:58:55,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:55,621 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-04 11:58:55,622 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:55,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:55,622 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-04 11:58:55,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:55,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:55,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:55,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:55,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:55,866 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:58:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:57,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:57,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:57,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:57,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:57,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:57,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:58:57,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:57,099 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:57,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:57,124 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 [2018-12-04 11:58:57,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:57,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:57,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:58:58,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:58:58,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:58:58,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:58:58,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:58:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:58,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:01,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:01,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2018-12-04 11:59:01,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:01,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-04 11:59:01,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-04 11:59:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2018-12-04 11:59:01,764 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-12-04 11:59:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:03,743 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-04 11:59:03,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 11:59:03,743 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-12-04 11:59:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:03,744 INFO L225 Difference]: With dead ends: 70 [2018-12-04 11:59:03,744 INFO L226 Difference]: Without dead ends: 69 [2018-12-04 11:59:03,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2018-12-04 11:59:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-04 11:59:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-04 11:59:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-04 11:59:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-04 11:59:03,751 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-04 11:59:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:03,751 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-04 11:59:03,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-04 11:59:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-04 11:59:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-04 11:59:03,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:03,752 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-04 11:59:03,752 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:03,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-04 11:59:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:03,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:03,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:05,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:05,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:05,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:05,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:05,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:05,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:59:05,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:05,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:05,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-04 11:59:05,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:05,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:05,377 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 [2018-12-04 11:59:05,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:05,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:05,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:59:07,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:59:07,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:07,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:07,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:59:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:07,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:10,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:10,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2018-12-04 11:59:10,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:10,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 11:59:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 11:59:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:59:10,156 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-12-04 11:59:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:12,920 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-04 11:59:12,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:59:12,921 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-12-04 11:59:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:12,921 INFO L225 Difference]: With dead ends: 72 [2018-12-04 11:59:12,922 INFO L226 Difference]: Without dead ends: 71 [2018-12-04 11:59:12,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:59:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-04 11:59:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-12-04 11:59:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-04 11:59:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-04 11:59:12,927 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-04 11:59:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:12,927 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-04 11:59:12,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 11:59:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-04 11:59:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-04 11:59:12,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:12,928 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-04 11:59:12,928 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:12,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-04 11:59:12,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:12,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:12,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:13,163 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:59:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:14,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:14,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:14,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:14,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:14,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:14,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:59:14,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:14,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:14,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:14,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:14,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:14,435 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 [2018-12-04 11:59:14,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:14,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:14,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:59:16,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:59:16,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:16,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:16,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:59:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:16,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:19,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:19,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2018-12-04 11:59:19,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:19,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-04 11:59:19,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-04 11:59:19,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2018-12-04 11:59:19,419 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-12-04 11:59:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:21,863 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-04 11:59:21,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-04 11:59:21,863 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-12-04 11:59:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:21,865 INFO L225 Difference]: With dead ends: 74 [2018-12-04 11:59:21,865 INFO L226 Difference]: Without dead ends: 73 [2018-12-04 11:59:21,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2018-12-04 11:59:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-04 11:59:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-04 11:59:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-04 11:59:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-04 11:59:21,870 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-04 11:59:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:21,870 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-04 11:59:21,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-04 11:59:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-04 11:59:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-04 11:59:21,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:21,871 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-04 11:59:21,871 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:21,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-04 11:59:21,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:21,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:21,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:21,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:21,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:22,132 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 11:59:22,371 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-04 11:59:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:23,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:23,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:23,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:23,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:23,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:23,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:59:23,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:23,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:23,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:23,660 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 [2018-12-04 11:59:23,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:23,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:23,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:59:25,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:59:25,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:25,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:25,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:59:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:25,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:29,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:29,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2018-12-04 11:59:29,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:29,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-04 11:59:29,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-04 11:59:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:59:29,060 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-12-04 11:59:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:31,667 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-04 11:59:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:59:31,667 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-12-04 11:59:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:31,668 INFO L225 Difference]: With dead ends: 76 [2018-12-04 11:59:31,669 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 11:59:31,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:59:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 11:59:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-04 11:59:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-04 11:59:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-04 11:59:31,674 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-04 11:59:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:31,674 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-04 11:59:31,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-04 11:59:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-04 11:59:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-04 11:59:31,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:31,675 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-04 11:59:31,675 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:31,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-04 11:59:31,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:31,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:31,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:31,873 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 11:59:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:33,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:33,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:33,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:33,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:33,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:33,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:59:33,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:33,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:33,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-04 11:59:33,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:33,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:33,429 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 [2018-12-04 11:59:33,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:33,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:33,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:59:35,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:59:35,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:35,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:35,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:59:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:35,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:38,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:38,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2018-12-04 11:59:38,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:38,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 11:59:38,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 11:59:38,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2018-12-04 11:59:38,948 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-12-04 11:59:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:42,049 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-04 11:59:42,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 11:59:42,049 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-12-04 11:59:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:42,050 INFO L225 Difference]: With dead ends: 78 [2018-12-04 11:59:42,050 INFO L226 Difference]: Without dead ends: 77 [2018-12-04 11:59:42,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2018-12-04 11:59:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-04 11:59:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-04 11:59:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-04 11:59:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-04 11:59:42,054 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-04 11:59:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:42,055 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-04 11:59:42,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 11:59:42,055 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-04 11:59:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-04 11:59:42,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:42,055 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-04 11:59:42,056 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:42,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-04 11:59:42,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:42,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:42,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:42,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:43,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:43,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:43,634 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:43,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:43,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:43,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:59:43,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:43,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:43,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:43,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:43,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:43,674 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 [2018-12-04 11:59:43,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:43,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:43,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:59:45,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:59:45,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:45,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:45,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:59:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:45,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:49,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:49,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2018-12-04 11:59:49,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:49,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-04 11:59:49,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-04 11:59:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:59:49,548 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-12-04 11:59:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:52,572 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-04 11:59:52,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-04 11:59:52,573 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-12-04 11:59:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:52,573 INFO L225 Difference]: With dead ends: 80 [2018-12-04 11:59:52,574 INFO L226 Difference]: Without dead ends: 79 [2018-12-04 11:59:52,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:59:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-04 11:59:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-12-04 11:59:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-04 11:59:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-04 11:59:52,579 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-04 11:59:52,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:52,579 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-04 11:59:52,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-04 11:59:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-04 11:59:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-04 11:59:52,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:52,580 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-04 11:59:52,580 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:52,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:52,580 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-04 11:59:52,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:52,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:52,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:52,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:52,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:52,755 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 11:59:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:54,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:54,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:54,240 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:54,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:54,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:54,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:59:54,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:54,250 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:54,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:54,297 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 [2018-12-04 11:59:54,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:54,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:54,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 11:59:56,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 11:59:56,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:59:56,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:59:56,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 11:59:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:56,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:00,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:00,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2018-12-04 12:00:00,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:00,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-04 12:00:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-04 12:00:00,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2018-12-04 12:00:00,420 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-12-04 12:00:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:03,273 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-04 12:00:03,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-04 12:00:03,273 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-12-04 12:00:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:03,274 INFO L225 Difference]: With dead ends: 82 [2018-12-04 12:00:03,275 INFO L226 Difference]: Without dead ends: 81 [2018-12-04 12:00:03,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2018-12-04 12:00:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-04 12:00:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-04 12:00:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-04 12:00:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-04 12:00:03,279 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-04 12:00:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:03,279 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-04 12:00:03,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-04 12:00:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-04 12:00:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-04 12:00:03,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:03,280 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-04 12:00:03,280 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:03,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-04 12:00:03,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:03,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:03,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:03,552 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:00:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:05,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:05,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:05,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:05,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:05,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:05,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:05,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:05,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:05,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-04 12:00:05,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:05,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:05,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 [2018-12-04 12:00:05,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:05,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:05,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:00:07,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:00:07,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:07,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:07,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:00:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:07,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:11,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:11,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2018-12-04 12:00:11,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:11,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-04 12:00:11,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-04 12:00:11,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 12:00:11,821 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-12-04 12:00:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:15,317 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-04 12:00:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-04 12:00:15,317 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-12-04 12:00:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:15,318 INFO L225 Difference]: With dead ends: 84 [2018-12-04 12:00:15,318 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 12:00:15,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 12:00:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 12:00:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-04 12:00:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-04 12:00:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-04 12:00:15,332 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-04 12:00:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:15,332 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-04 12:00:15,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-04 12:00:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-04 12:00:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-04 12:00:15,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:15,333 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-04 12:00:15,333 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:15,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-04 12:00:15,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:15,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:15,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:15,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:15,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:15,623 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:00:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:17,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:17,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:17,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:17,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:17,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:17,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:17,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:17,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:17,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:17,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:17,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:17,539 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 [2018-12-04 12:00:17,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:17,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:17,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:00:19,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:00:19,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:19,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:19,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:00:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:19,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:24,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:24,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2018-12-04 12:00:24,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:24,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-04 12:00:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-04 12:00:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2018-12-04 12:00:24,316 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-12-04 12:00:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:27,355 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-04 12:00:27,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 12:00:27,355 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-12-04 12:00:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:27,357 INFO L225 Difference]: With dead ends: 86 [2018-12-04 12:00:27,357 INFO L226 Difference]: Without dead ends: 85 [2018-12-04 12:00:27,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2018-12-04 12:00:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-04 12:00:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-04 12:00:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-04 12:00:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-04 12:00:27,362 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-04 12:00:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:27,363 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-04 12:00:27,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-04 12:00:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-04 12:00:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-04 12:00:27,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:27,364 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-04 12:00:27,364 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:27,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:27,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-04 12:00:27,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:27,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:27,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:27,652 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:00:27,913 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:00:28,172 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:00:28,456 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:00:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:30,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:30,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:30,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:30,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:30,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:30,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:30,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:30,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:30,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:30,104 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 [2018-12-04 12:00:30,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:30,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:30,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:00:32,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:00:32,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:32,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:32,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:00:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:32,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:37,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:37,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2018-12-04 12:00:37,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:37,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-04 12:00:37,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-04 12:00:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 12:00:37,431 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-12-04 12:00:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:41,386 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-04 12:00:41,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-04 12:00:41,386 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-12-04 12:00:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:41,388 INFO L225 Difference]: With dead ends: 88 [2018-12-04 12:00:41,388 INFO L226 Difference]: Without dead ends: 87 [2018-12-04 12:00:41,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 12:00:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-04 12:00:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-12-04 12:00:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-04 12:00:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-04 12:00:41,394 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-04 12:00:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:41,394 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-04 12:00:41,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-04 12:00:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-04 12:00:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-04 12:00:41,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:41,395 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-04 12:00:41,395 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:41,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-04 12:00:41,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:41,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:41,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:41,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:41,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:41,628 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:00:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:43,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:43,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:43,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:43,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:43,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:43,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:43,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:43,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:43,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-04 12:00:43,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:43,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:43,483 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 [2018-12-04 12:00:43,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:43,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:43,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:00:46,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:00:46,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:46,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:46,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:00:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:46,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:50,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:50,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2018-12-04 12:00:50,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:50,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 12:00:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 12:00:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2018-12-04 12:00:50,774 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-12-04 12:00:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:55,525 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-04 12:00:55,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-04 12:00:55,525 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-12-04 12:00:55,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:55,526 INFO L225 Difference]: With dead ends: 90 [2018-12-04 12:00:55,527 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 12:00:55,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2018-12-04 12:00:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 12:00:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-04 12:00:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-04 12:00:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-04 12:00:55,532 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-04 12:00:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-04 12:00:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 12:00:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-04 12:00:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-04 12:00:55,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:55,533 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-04 12:00:55,533 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:55,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-04 12:00:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:55,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:55,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:57,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:57,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:57,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:57,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:57,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:57,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:57,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:57,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:57,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:57,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:57,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:57,690 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 [2018-12-04 12:00:57,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:00:57,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:00:57,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:01:00,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:01:00,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:01:00,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:01:00,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:01:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:00,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:05,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2018-12-04 12:01:05,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:05,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-04 12:01:05,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-04 12:01:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 12:01:05,392 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-12-04 12:01:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:10,141 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-04 12:01:10,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 12:01:10,142 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-12-04 12:01:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:10,143 INFO L225 Difference]: With dead ends: 92 [2018-12-04 12:01:10,143 INFO L226 Difference]: Without dead ends: 91 [2018-12-04 12:01:10,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 12:01:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-04 12:01:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-04 12:01:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-04 12:01:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-04 12:01:10,149 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-04 12:01:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:10,150 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-04 12:01:10,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-04 12:01:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-04 12:01:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-04 12:01:10,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:10,150 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-04 12:01:10,150 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:10,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-04 12:01:10,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:10,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:10,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:10,409 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:01:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:12,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:12,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:12,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:12,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:12,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:12,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:12,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:12,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:12,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:12,321 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 [2018-12-04 12:01:12,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:01:12,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:01:12,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:01:15,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:01:15,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:01:15,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:01:15,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:01:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:15,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:20,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:20,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2018-12-04 12:01:20,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:20,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-04 12:01:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-04 12:01:20,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2018-12-04 12:01:20,464 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-12-04 12:01:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:24,422 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-04 12:01:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 12:01:24,422 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-12-04 12:01:24,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:24,423 INFO L225 Difference]: With dead ends: 94 [2018-12-04 12:01:24,423 INFO L226 Difference]: Without dead ends: 93 [2018-12-04 12:01:24,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2018-12-04 12:01:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-04 12:01:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-04 12:01:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-04 12:01:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-04 12:01:24,428 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-04 12:01:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:24,429 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-04 12:01:24,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-04 12:01:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-04 12:01:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-04 12:01:24,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:24,429 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-04 12:01:24,430 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:24,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-04 12:01:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:24,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:24,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:24,702 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:01:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:26,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:26,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:26,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:26,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:26,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:26,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:26,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:26,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:26,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-04 12:01:26,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:26,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:26,712 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 [2018-12-04 12:01:26,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:01:26,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:01:26,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:01:30,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:01:30,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:01:30,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:01:30,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:01:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:30,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:35,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:35,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2018-12-04 12:01:35,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:35,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 12:01:35,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 12:01:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 12:01:35,730 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-12-04 12:01:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:39,999 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-04 12:01:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-04 12:01:40,000 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-12-04 12:01:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:40,000 INFO L225 Difference]: With dead ends: 96 [2018-12-04 12:01:40,001 INFO L226 Difference]: Without dead ends: 95 [2018-12-04 12:01:40,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 12:01:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-04 12:01:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-04 12:01:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-04 12:01:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-04 12:01:40,004 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-04 12:01:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:40,005 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-04 12:01:40,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 12:01:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-04 12:01:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-04 12:01:40,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:40,005 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-04 12:01:40,006 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:40,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:40,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-04 12:01:40,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:40,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:40,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:40,275 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:01:40,518 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:01:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:42,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:42,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:42,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:42,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:42,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:42,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:42,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:42,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:42,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:42,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:42,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:42,606 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 [2018-12-04 12:01:42,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:01:42,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:01:42,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:01:45,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:01:45,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:01:45,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:01:45,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:01:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:46,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:51,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:51,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2018-12-04 12:01:51,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:51,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-04 12:01:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-04 12:01:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2018-12-04 12:01:51,672 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-12-04 12:01:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:56,327 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-04 12:01:56,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 12:01:56,327 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-12-04 12:01:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:56,328 INFO L225 Difference]: With dead ends: 98 [2018-12-04 12:01:56,329 INFO L226 Difference]: Without dead ends: 97 [2018-12-04 12:01:56,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2018-12-04 12:01:56,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-04 12:01:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-04 12:01:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-04 12:01:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-04 12:01:56,333 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-04 12:01:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:56,333 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-04 12:01:56,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-04 12:01:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-04 12:01:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-04 12:01:56,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:56,334 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-04 12:01:56,334 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:56,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-04 12:01:56,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:56,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:56,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:56,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:56,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:56,562 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:01:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:58,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:58,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:58,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:58,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:58,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:58,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:58,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:58,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:58,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:58,781 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 [2018-12-04 12:01:58,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:01:58,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:01:58,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:02:01,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:02:01,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:02:01,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:02:01,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:02:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:02,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:07,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:07,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2018-12-04 12:02:07,749 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:07,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-04 12:02:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-04 12:02:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 12:02:07,750 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-12-04 12:02:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:12,151 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-04 12:02:12,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-04 12:02:12,152 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-12-04 12:02:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:12,153 INFO L225 Difference]: With dead ends: 100 [2018-12-04 12:02:12,153 INFO L226 Difference]: Without dead ends: 99 [2018-12-04 12:02:12,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 12:02:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-04 12:02:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-04 12:02:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-04 12:02:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-04 12:02:12,159 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-04 12:02:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:12,159 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-04 12:02:12,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-04 12:02:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-04 12:02:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-04 12:02:12,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:12,160 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-04 12:02:12,160 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:12,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-04 12:02:12,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:12,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:12,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:12,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:12,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:12,360 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:02:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:14,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:14,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:14,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:14,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:14,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:14,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:02:14,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:02:14,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:02:14,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-04 12:02:14,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:14,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:14,787 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 [2018-12-04 12:02:14,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:02:14,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:02:14,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:02:19,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:02:19,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:02:19,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:02:19,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:02:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:19,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:25,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:25,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2018-12-04 12:02:25,344 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:25,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 12:02:25,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 12:02:25,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2018-12-04 12:02:25,345 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-12-04 12:02:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:29,646 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-04 12:02:29,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 12:02:29,647 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-12-04 12:02:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:29,648 INFO L225 Difference]: With dead ends: 102 [2018-12-04 12:02:29,648 INFO L226 Difference]: Without dead ends: 101 [2018-12-04 12:02:29,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2018-12-04 12:02:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-04 12:02:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-04 12:02:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-04 12:02:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-04 12:02:29,654 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-04 12:02:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:29,654 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-04 12:02:29,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 12:02:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-04 12:02:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-04 12:02:29,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:29,655 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-04 12:02:29,655 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:29,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:29,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-04 12:02:29,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:29,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:29,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:32,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:32,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:32,055 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:32,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:32,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:32,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:02:32,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:02:32,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:02:32,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:02:32,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:32,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:32,103 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 [2018-12-04 12:02:32,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:02:32,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:02:32,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:02:35,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:02:35,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:02:35,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:02:35,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:02:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:35,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:41,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:41,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2018-12-04 12:02:41,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:41,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-04 12:02:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-04 12:02:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 12:02:41,964 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-12-04 12:02:46,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:46,500 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-04 12:02:46,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-04 12:02:46,500 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-12-04 12:02:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:46,501 INFO L225 Difference]: With dead ends: 104 [2018-12-04 12:02:46,501 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 12:02:46,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 12:02:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 12:02:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-04 12:02:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-04 12:02:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-04 12:02:46,508 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-04 12:02:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:46,509 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-04 12:02:46,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-04 12:02:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-04 12:02:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-04 12:02:46,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:46,510 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-04 12:02:46,510 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:46,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:46,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-04 12:02:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:46,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:46,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:48,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:48,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:48,893 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:48,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:48,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:48,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:02:48,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:48,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:02:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:48,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:48,953 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 [2018-12-04 12:02:48,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:02:48,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:02:48,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:02:52,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:02:52,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:02:52,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:02:52,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:02:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:52,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:59,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:59,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2018-12-04 12:02:59,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:59,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-04 12:02:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-04 12:02:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2018-12-04 12:02:59,310 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2018-12-04 12:03:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:04,163 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-04 12:03:04,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 12:03:04,164 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2018-12-04 12:03:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:04,165 INFO L225 Difference]: With dead ends: 106 [2018-12-04 12:03:04,165 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 12:03:04,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2018-12-04 12:03:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 12:03:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-04 12:03:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-04 12:03:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-04 12:03:04,172 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-04 12:03:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:04,172 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-04 12:03:04,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-04 12:03:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-04 12:03:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-04 12:03:04,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:04,173 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-04 12:03:04,173 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:04,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-04 12:03:04,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:04,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:04,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:04,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:04,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:04,438 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:03:04,681 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:03:04,946 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:03:05,235 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:03:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:07,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:07,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:07,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:07,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:07,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:07,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:03:07,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:03:07,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:03:07,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-04 12:03:07,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:07,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:07,859 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 [2018-12-04 12:03:07,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:03:07,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:03:07,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:03:11,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:03:11,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:03:11,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:03:11,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:03:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:11,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:18,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:18,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2018-12-04 12:03:18,483 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:18,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 12:03:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 12:03:18,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 12:03:18,484 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2018-12-04 12:03:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:24,271 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-04 12:03:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 12:03:24,272 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2018-12-04 12:03:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:24,273 INFO L225 Difference]: With dead ends: 108 [2018-12-04 12:03:24,273 INFO L226 Difference]: Without dead ends: 107 [2018-12-04 12:03:24,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 12:03:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-04 12:03:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-04 12:03:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-04 12:03:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-04 12:03:24,279 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-04 12:03:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:24,280 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-04 12:03:24,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 12:03:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-04 12:03:24,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-04 12:03:24,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:24,281 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-04 12:03:24,281 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:24,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:24,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-04 12:03:24,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:24,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:24,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:27,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:27,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:27,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:27,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:27,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:27,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:03:27,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:03:27,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:03:27,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:03:27,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:27,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:27,229 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 [2018-12-04 12:03:27,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:03:27,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:03:27,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:03:31,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:03:31,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:03:31,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:03:31,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:03:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:31,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:38,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:38,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2018-12-04 12:03:38,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:38,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-04 12:03:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-04 12:03:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2018-12-04 12:03:38,445 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2018-12-04 12:03:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:45,601 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-04 12:03:45,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-04 12:03:45,602 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2018-12-04 12:03:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:45,603 INFO L225 Difference]: With dead ends: 110 [2018-12-04 12:03:45,603 INFO L226 Difference]: Without dead ends: 109 [2018-12-04 12:03:45,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2018-12-04 12:03:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-04 12:03:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-12-04 12:03:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-04 12:03:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-04 12:03:45,609 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-04 12:03:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:45,610 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-04 12:03:45,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-04 12:03:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-04 12:03:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-04 12:03:45,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:45,610 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-04 12:03:45,610 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:45,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-04 12:03:45,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:45,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:45,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:45,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:45,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:48,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:48,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:48,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:48,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:48,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:48,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:03:48,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:48,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:03:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:48,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:48,550 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 [2018-12-04 12:03:48,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:03:48,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:03:48,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:03:52,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:03:52,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:03:52,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:03:52,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:03:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:53,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:00,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:00,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2018-12-04 12:04:00,499 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:00,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-04 12:04:00,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-04 12:04:00,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 12:04:00,500 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2018-12-04 12:04:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:05,398 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-04 12:04:05,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-04 12:04:05,398 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2018-12-04 12:04:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:05,399 INFO L225 Difference]: With dead ends: 112 [2018-12-04 12:04:05,400 INFO L226 Difference]: Without dead ends: 111 [2018-12-04 12:04:05,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 12:04:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-04 12:04:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-12-04 12:04:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-04 12:04:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-04 12:04:05,406 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-04 12:04:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:05,406 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-04 12:04:05,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-04 12:04:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-04 12:04:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-04 12:04:05,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:05,407 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-04 12:04:05,407 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:05,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:05,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-04 12:04:05,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:05,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:04:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:05,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:05,641 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:04:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:08,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:08,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:08,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:08,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:08,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:08,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:04:08,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:04:08,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:04:08,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-04 12:04:08,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:08,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:08,550 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 [2018-12-04 12:04:08,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:04:08,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:04:08,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:04:12,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:04:12,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:04:12,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:04:12,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:04:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:12,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:20,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:20,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2018-12-04 12:04:20,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:20,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-04 12:04:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-04 12:04:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2018-12-04 12:04:20,307 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2018-12-04 12:04:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:27,010 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-04 12:04:27,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-04 12:04:27,010 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2018-12-04 12:04:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:27,011 INFO L225 Difference]: With dead ends: 114 [2018-12-04 12:04:27,011 INFO L226 Difference]: Without dead ends: 113 [2018-12-04 12:04:27,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2018-12-04 12:04:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-04 12:04:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-04 12:04:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-04 12:04:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-04 12:04:27,016 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-04 12:04:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:27,016 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-04 12:04:27,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-04 12:04:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-04 12:04:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-04 12:04:27,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:27,017 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-04 12:04:27,017 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:27,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-04 12:04:27,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:27,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:27,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:27,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:27,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:29,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:29,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:29,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:29,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:29,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:29,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:04:29,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:04:29,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:04:29,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:04:29,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:29,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:29,911 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 [2018-12-04 12:04:29,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:04:29,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:04:29,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:04:34,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:04:34,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:04:34,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:04:34,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:04:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:34,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:42,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:42,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2018-12-04 12:04:42,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:42,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-12-04 12:04:42,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-12-04 12:04:42,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 12:04:42,475 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2018-12-04 12:04:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:48,090 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-04 12:04:48,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-04 12:04:48,091 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2018-12-04 12:04:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:48,092 INFO L225 Difference]: With dead ends: 116 [2018-12-04 12:04:48,092 INFO L226 Difference]: Without dead ends: 115 [2018-12-04 12:04:48,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 12:04:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-04 12:04:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-04 12:04:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-04 12:04:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-04 12:04:48,099 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-04 12:04:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:48,100 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-04 12:04:48,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-12-04 12:04:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-04 12:04:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-04 12:04:48,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:48,101 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-04 12:04:48,101 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:48,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-04 12:04:48,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:48,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:48,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:50,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:50,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:50,939 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:50,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:50,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:50,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:04:50,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:04:50,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:04:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:50,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:50,988 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 [2018-12-04 12:04:50,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:04:50,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:04:50,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:04:55,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:04:55,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:04:55,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:04:55,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:04:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:55,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:04,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:04,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2018-12-04 12:05:04,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:04,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-12-04 12:05:04,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-12-04 12:05:04,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2018-12-04 12:05:04,149 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2018-12-04 12:05:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:11,731 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-04 12:05:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-04 12:05:11,732 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2018-12-04 12:05:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:11,733 INFO L225 Difference]: With dead ends: 118 [2018-12-04 12:05:11,733 INFO L226 Difference]: Without dead ends: 117 [2018-12-04 12:05:11,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2018-12-04 12:05:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-04 12:05:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-12-04 12:05:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-04 12:05:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-04 12:05:11,739 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-04 12:05:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:11,739 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-04 12:05:11,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-12-04 12:05:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-04 12:05:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-04 12:05:11,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:11,740 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-04 12:05:11,740 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:11,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-04 12:05:11,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:11,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:11,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:11,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:12,003 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:05:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:15,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:15,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:15,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:15,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:15,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:15,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:05:15,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:05:15,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:05:15,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-04 12:05:15,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:15,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:15,242 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 [2018-12-04 12:05:15,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:05:15,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:05:15,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:05:20,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:05:20,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:05:20,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:05:20,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:05:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:20,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:28,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:28,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2018-12-04 12:05:28,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:28,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-04 12:05:28,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-04 12:05:28,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 12:05:28,708 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2018-12-04 12:05:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:34,944 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-04 12:05:34,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-04 12:05:34,944 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2018-12-04 12:05:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:34,945 INFO L225 Difference]: With dead ends: 120 [2018-12-04 12:05:34,946 INFO L226 Difference]: Without dead ends: 119 [2018-12-04 12:05:34,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 12:05:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-04 12:05:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-04 12:05:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-04 12:05:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-04 12:05:34,951 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-04 12:05:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:34,952 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-04 12:05:34,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-04 12:05:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-04 12:05:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-04 12:05:34,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:34,952 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-04 12:05:34,953 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:34,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-04 12:05:34,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:34,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:34,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:34,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:34,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:35,218 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:05:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:38,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:38,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:38,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:38,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:38,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:38,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:05:38,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:05:38,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:05:38,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:05:38,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:38,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:38,237 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 [2018-12-04 12:05:38,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:05:38,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:05:38,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:05:43,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:05:43,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:05:43,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:05:43,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:05:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:43,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:52,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:52,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2018-12-04 12:05:52,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:52,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-12-04 12:05:52,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-12-04 12:05:52,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2018-12-04 12:05:52,384 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2018-12-04 12:05:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:57,962 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-12-04 12:05:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-04 12:05:57,962 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2018-12-04 12:05:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:57,963 INFO L225 Difference]: With dead ends: 122 [2018-12-04 12:05:57,963 INFO L226 Difference]: Without dead ends: 121 [2018-12-04 12:05:57,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2018-12-04 12:05:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-04 12:05:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-04 12:05:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-04 12:05:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-04 12:05:57,968 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-04 12:05:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:57,968 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-04 12:05:57,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-12-04 12:05:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-04 12:05:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-04 12:05:57,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:57,968 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-04 12:05:57,969 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:57,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-04 12:05:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:57,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:57,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:58,173 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:06:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:01,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:01,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:01,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:01,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:01,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:01,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:06:01,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:01,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:06:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:01,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:01,425 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 [2018-12-04 12:06:01,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:06:01,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:06:01,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:06:06,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:06:06,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:06:06,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:06:06,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:06:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:06,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:15,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:15,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2018-12-04 12:06:15,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:15,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-12-04 12:06:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-12-04 12:06:15,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 12:06:15,638 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2018-12-04 12:06:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:23,129 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-12-04 12:06:23,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-04 12:06:23,135 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2018-12-04 12:06:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:23,136 INFO L225 Difference]: With dead ends: 124 [2018-12-04 12:06:23,136 INFO L226 Difference]: Without dead ends: 123 [2018-12-04 12:06:23,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 12:06:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-04 12:06:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-12-04 12:06:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-04 12:06:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-04 12:06:23,142 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-04 12:06:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:23,142 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-04 12:06:23,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-12-04 12:06:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-04 12:06:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-04 12:06:23,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:23,143 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-04 12:06:23,144 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:23,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-04 12:06:23,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:23,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:23,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:23,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:23,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:26,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:26,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:26,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:26,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:26,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:26,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:06:26,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:06:26,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:06:26,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-04 12:06:26,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:26,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:26,656 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 [2018-12-04 12:06:26,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:06:26,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:06:26,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:06:31,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:06:31,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:06:31,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:06:31,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:06:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:32,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:41,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:41,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2018-12-04 12:06:41,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:41,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-04 12:06:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-04 12:06:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2018-12-04 12:06:41,311 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2018-12-04 12:06:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:50,448 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-12-04 12:06:50,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-04 12:06:50,449 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2018-12-04 12:06:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:50,449 INFO L225 Difference]: With dead ends: 126 [2018-12-04 12:06:50,449 INFO L226 Difference]: Without dead ends: 125 [2018-12-04 12:06:50,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2018-12-04 12:06:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-04 12:06:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-12-04 12:06:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-04 12:06:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-04 12:06:50,456 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-04 12:06:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:50,456 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-04 12:06:50,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-04 12:06:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-04 12:06:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-04 12:06:50,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:50,458 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-04 12:06:50,458 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:50,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-04 12:06:50,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:50,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:06:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:50,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:50,746 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:06:50,998 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:06:51,270 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:06:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:54,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:54,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:54,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:54,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:54,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:54,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:06:54,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:06:54,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:06:54,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:06:54,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:54,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:54,701 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 [2018-12-04 12:06:54,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:06:54,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:06:54,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:06:59,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:06:59,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:06:59,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:06:59,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:07:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:00,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:09,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:09,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2018-12-04 12:07:09,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:09,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-12-04 12:07:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-12-04 12:07:09,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 12:07:09,697 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2018-12-04 12:07:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:19,192 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-12-04 12:07:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-04 12:07:19,193 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2018-12-04 12:07:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:19,194 INFO L225 Difference]: With dead ends: 128 [2018-12-04 12:07:19,194 INFO L226 Difference]: Without dead ends: 127 [2018-12-04 12:07:19,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 12:07:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-04 12:07:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-12-04 12:07:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-04 12:07:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-04 12:07:19,199 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-04 12:07:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:19,200 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-04 12:07:19,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-12-04 12:07:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-04 12:07:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-04 12:07:19,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:19,200 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-04 12:07:19,201 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:19,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-04 12:07:19,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:19,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:07:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:19,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:19,400 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-04 12:07:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:22,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:22,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:22,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:22,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:22,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:22,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:07:22,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:07:22,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:07:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:22,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:22,952 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 [2018-12-04 12:07:22,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:07:22,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:07:22,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:07:28,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:07:28,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:07:28,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:07:28,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:07:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:28,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:38,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:38,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2018-12-04 12:07:38,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:38,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-12-04 12:07:38,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-12-04 12:07:38,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2018-12-04 12:07:38,284 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2018-12-04 12:07:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:46,473 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-12-04 12:07:46,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-04 12:07:46,473 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2018-12-04 12:07:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:46,475 INFO L225 Difference]: With dead ends: 130 [2018-12-04 12:07:46,475 INFO L226 Difference]: Without dead ends: 129 [2018-12-04 12:07:46,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2018-12-04 12:07:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-04 12:07:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-04 12:07:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-04 12:07:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-04 12:07:46,481 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-04 12:07:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:46,481 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-04 12:07:46,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-12-04 12:07:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-04 12:07:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-04 12:07:46,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:46,482 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-04 12:07:46,482 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:46,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-04 12:07:46,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:46,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:07:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:46,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:49,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:49,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:49,937 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:49,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:49,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:49,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:07:49,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:07:49,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:07:50,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-04 12:07:50,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:07:50,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:50,071 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 [2018-12-04 12:07:50,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:07:50,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:07:50,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:07:55,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:07:55,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:07:55,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:07:55,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:07:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:55,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:05,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:05,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2018-12-04 12:08:05,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:05,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-04 12:08:05,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-04 12:08:05,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 12:08:05,808 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2018-12-04 12:08:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:12,451 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-12-04 12:08:12,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-04 12:08:12,452 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2018-12-04 12:08:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:12,453 INFO L225 Difference]: With dead ends: 132 [2018-12-04 12:08:12,453 INFO L226 Difference]: Without dead ends: 131 [2018-12-04 12:08:12,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 12:08:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-04 12:08:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-04 12:08:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-04 12:08:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-04 12:08:12,459 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-04 12:08:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:12,459 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-04 12:08:12,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-04 12:08:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-04 12:08:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-04 12:08:12,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:12,460 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-04 12:08:12,460 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:12,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-04 12:08:12,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:12,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:12,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:08:12,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:12,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:16,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:16,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:16,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:16,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:16,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:16,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:08:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:08:16,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:08:16,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:08:16,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:08:16,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:16,141 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 [2018-12-04 12:08:16,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:08:16,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:08:16,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:08:21,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:08:21,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:08:21,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:08:21,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:08:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:22,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:32,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:32,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2018-12-04 12:08:32,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:32,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-12-04 12:08:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-12-04 12:08:32,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2018-12-04 12:08:32,638 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2018-12-04 12:08:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:40,987 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-12-04 12:08:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-04 12:08:40,988 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2018-12-04 12:08:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:40,989 INFO L225 Difference]: With dead ends: 134 [2018-12-04 12:08:40,989 INFO L226 Difference]: Without dead ends: 133 [2018-12-04 12:08:40,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2018-12-04 12:08:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-04 12:08:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-04 12:08:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-04 12:08:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-04 12:08:40,996 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-04 12:08:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:40,997 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-04 12:08:40,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-12-04 12:08:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-04 12:08:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-04 12:08:40,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:40,998 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-04 12:08:40,998 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:40,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-04 12:08:40,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:40,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:08:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:40,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:41,210 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:08:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:44,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:44,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:44,925 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:44,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:44,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:44,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:08:44,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:08:44,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:08:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:44,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:44,997 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 [2018-12-04 12:08:44,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:08:45,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:08:45,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:08:51,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:08:51,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:08:51,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:08:51,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:08:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:51,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:09:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:01,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:09:01,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2018-12-04 12:09:01,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:09:01,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-12-04 12:09:01,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-12-04 12:09:01,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 12:09:01,950 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2018-12-04 12:09:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:09:12,411 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-12-04 12:09:12,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-04 12:09:12,412 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2018-12-04 12:09:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:09:12,413 INFO L225 Difference]: With dead ends: 136 [2018-12-04 12:09:12,413 INFO L226 Difference]: Without dead ends: 135 [2018-12-04 12:09:12,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 12:09:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-04 12:09:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-12-04 12:09:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-04 12:09:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-04 12:09:12,420 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-04 12:09:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:09:12,420 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-04 12:09:12,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-12-04 12:09:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-04 12:09:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-04 12:09:12,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:09:12,421 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-04 12:09:12,422 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:09:12,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:09:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-04 12:09:12,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:09:12,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:12,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:09:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:12,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:09:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:12,625 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-04 12:09:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:16,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:16,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:09:16,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:09:16,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:09:16,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:16,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:09:16,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:09:16,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:09:16,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-04 12:09:16,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:09:16,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:16,558 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 [2018-12-04 12:09:16,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:09:16,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:09:16,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:09:23,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:09:23,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:09:23,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:09:23,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:09:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:23,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:09:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:35,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:09:35,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2018-12-04 12:09:35,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:09:35,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-04 12:09:35,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-04 12:09:35,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2018-12-04 12:09:35,226 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2018-12-04 12:09:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:09:42,457 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-12-04 12:09:42,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-04 12:09:42,458 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2018-12-04 12:09:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:09:42,459 INFO L225 Difference]: With dead ends: 138 [2018-12-04 12:09:42,459 INFO L226 Difference]: Without dead ends: 137 [2018-12-04 12:09:42,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2018-12-04 12:09:42,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-04 12:09:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-04 12:09:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-04 12:09:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-04 12:09:42,464 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-04 12:09:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:09:42,464 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-04 12:09:42,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-04 12:09:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-04 12:09:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-04 12:09:42,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:09:42,465 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-04 12:09:42,465 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:09:42,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:09:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-04 12:09:42,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:09:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:42,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:09:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:42,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:09:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:46,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:46,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:09:46,235 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:09:46,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:09:46,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:46,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-04 12:09:46,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:09:46,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:09:46,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:09:46,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:09:46,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:46,308 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 [2018-12-04 12:09:46,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:09:46,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:09:46,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-04 12:09:52,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-04 12:09:52,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 12:09:52,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 12:09:52,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-04 12:09:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:52,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:10:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:10:03,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:10:03,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2018-12-04 12:10:03,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:10:03,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-12-04 12:10:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-12-04 12:10:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 12:10:03,407 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states.