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-b7bd044-m [2019-01-20 10:23:50,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:23:50,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:23:50,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:23:50,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:23:50,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:23:50,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:23:50,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:23:50,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:23:51,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:23:51,024 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:23:51,024 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:23:51,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:23:51,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:23:51,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:23:51,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:23:51,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:23:51,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:23:51,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:23:51,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:23:51,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:23:51,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:23:51,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:23:51,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:23:51,055 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:23:51,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:23:51,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:23:51,060 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:23:51,061 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:23:51,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:23:51,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:23:51,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:23:51,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:23:51,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:23:51,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:23:51,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:23:51,066 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:23:51,078 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:23:51,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:23:51,080 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:23:51,080 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:23:51,080 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:23:51,080 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:23:51,080 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:23:51,081 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:23:51,081 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:23:51,081 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:23:51,081 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:23:51,081 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:23:51,082 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:23:51,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:23:51,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:23:51,083 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:23:51,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:23:51,083 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:23:51,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:23:51,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:23:51,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:23:51,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:23:51,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:23:51,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:23:51,084 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:23:51,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:23:51,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:23:51,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:23:51,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:23:51,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:23:51,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:23:51,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:23:51,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:23:51,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:23:51,086 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:23:51,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:23:51,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:23:51,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:23:51,087 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:23:51,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:23:51,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:23:51,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:23:51,133 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:23:51,134 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:23:51,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-01-20 10:23:51,135 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-01-20 10:23:51,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:23:51,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:23:51,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:23:51,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:23:51,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:23:51,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,208 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-20 10:23:51,208 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-20 10:23:51,208 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-20 10:23:51,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:23:51,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:23:51,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:23:51,212 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:23:51,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:23:51,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:23:51,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:23:51,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:23:51,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:23:51,303 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-20 10:23:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-20 10:23:51,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-20 10:23:51,464 INFO L278 CfgBuilder]: Using library mode [2019-01-20 10:23:51,465 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-20 10:23:51,466 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:51 BoogieIcfgContainer [2019-01-20 10:23:51,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:23:51,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:23:51,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:23:51,471 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:23:51,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/2) ... [2019-01-20 10:23:51,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546c60e4 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:23:51, skipping insertion in model container [2019-01-20 10:23:51,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:51" (2/2) ... [2019-01-20 10:23:51,475 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-01-20 10:23:51,485 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:23:51,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 10:23:51,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 10:23:51,546 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:23:51,546 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:23:51,547 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:23:51,547 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:23:51,547 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:23:51,547 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:23:51,547 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:23:51,548 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:23:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-20 10:23:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:23:51,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:51,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:23:51,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-01-20 10:23:51,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:51,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:51,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:51,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:51,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:52,111 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-01-20 10:23:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:52,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:23:52,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:23:52,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:23:52,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:23:52,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:23:52,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:23:52,209 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-20 10:23:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:52,326 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-20 10:23:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:23:52,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:23:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:52,340 INFO L225 Difference]: With dead ends: 14 [2019-01-20 10:23:52,340 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 10:23:52,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:23:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 10:23:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-20 10:23:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-20 10:23:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-20 10:23:52,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-01-20 10:23:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:52,377 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-20 10:23:52,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:23:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-20 10:23:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:23:52,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:52,379 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 10:23:52,379 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:52,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:52,380 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-01-20 10:23:52,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:52,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:52,652 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:23:53,144 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-20 10:23:53,499 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-20 10:23:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:53,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:53,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:53,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:23:53,504 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-01-20 10:23:53,561 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:23:53,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:23:54,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:23:54,233 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. [2019-01-20 10:23:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:54,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:23:54,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:54,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:54,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:54,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:54,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:54,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:23:54,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:54,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:54,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:23:54,620 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 [2019-01-20 10:23:54,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:54,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:54,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:23:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:54,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:54,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:54,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:23:54,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:54,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:23:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:23:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:23:54,868 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-01-20 10:23:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:55,136 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-20 10:23:55,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:23:55,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-20 10:23:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:55,138 INFO L225 Difference]: With dead ends: 10 [2019-01-20 10:23:55,139 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 10:23:55,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:23:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 10:23:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-20 10:23:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 10:23:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-20 10:23:55,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-20 10:23:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:55,147 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-20 10:23:55,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:23:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-20 10:23:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:23:55,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:55,148 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-01-20 10:23:55,148 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-01-20 10:23:55,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:55,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:55,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:55,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:55,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:55,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:55,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:55,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:55,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:55,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:55,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:55,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:55,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:55,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:23:55,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:55,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:55,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:23:55,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:55,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:55,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:23:55,568 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 [2019-01-20 10:23:55,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:55,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:55,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:23:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:55,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:55,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:55,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:23:55,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:55,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:23:55,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:23:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:23:55,830 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-01-20 10:23:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:55,936 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-20 10:23:55,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:23:55,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:23:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:55,937 INFO L225 Difference]: With dead ends: 12 [2019-01-20 10:23:55,937 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 10:23:55,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:23:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 10:23:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-20 10:23:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 10:23:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-20 10:23:55,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-01-20 10:23:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:55,941 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-20 10:23:55,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:23:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-20 10:23:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:23:55,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:55,942 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-01-20 10:23:55,942 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:55,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-01-20 10:23:55,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:55,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:55,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:55,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:55,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:56,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:56,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:56,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:56,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:56,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:56,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:56,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:56,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:56,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:56,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:56,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:23:56,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:56,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:56,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:23:56,647 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 [2019-01-20 10:23:56,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:56,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:56,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:23:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:56,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:56,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:23:56,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:56,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:23:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:23:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:23:56,889 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-01-20 10:23:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:57,012 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-20 10:23:57,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:23:57,014 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-20 10:23:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:57,014 INFO L225 Difference]: With dead ends: 14 [2019-01-20 10:23:57,014 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 10:23:57,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:23:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 10:23:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-20 10:23:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:23:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-20 10:23:57,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-20 10:23:57,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:57,019 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-20 10:23:57,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:23:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-20 10:23:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 10:23:57,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:57,020 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-01-20 10:23:57,020 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-01-20 10:23:57,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:57,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:57,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:57,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:57,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:57,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:57,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:57,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:57,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:57,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:23:57,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:57,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:57,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:23:57,614 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 [2019-01-20 10:23:57,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:57,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:57,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:23:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:57,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:57,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-01-20 10:23:57,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:57,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-20 10:23:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-20 10:23:57,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:23:57,859 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-01-20 10:23:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:58,254 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-20 10:23:58,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:23:58,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-01-20 10:23:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:58,255 INFO L225 Difference]: With dead ends: 16 [2019-01-20 10:23:58,255 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 10:23:58,255 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 [2019-01-20 10:23:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 10:23:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-20 10:23:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:23:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-20 10:23:58,259 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-01-20 10:23:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:58,259 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-20 10:23:58,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-20 10:23:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-20 10:23:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-20 10:23:58,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:58,260 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-01-20 10:23:58,260 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:58,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-01-20 10:23:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:58,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:58,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:58,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:58,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:58,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:58,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:58,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-20 10:23:58,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:58,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:58,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:23:58,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:58,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:58,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:23:58,760 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 [2019-01-20 10:23:58,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:58,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:58,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:23:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:58,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:59,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:59,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-01-20 10:23:59,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:59,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 10:23:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 10:23:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-01-20 10:23:59,088 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-01-20 10:23:59,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:59,224 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-20 10:23:59,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:23:59,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-01-20 10:23:59,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:59,226 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:23:59,226 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:23:59,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-01-20 10:23:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:23:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-20 10:23:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:23:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-20 10:23:59,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-01-20 10:23:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:59,231 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-20 10:23:59,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 10:23:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-20 10:23:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-20 10:23:59,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:59,232 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-01-20 10:23:59,233 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-01-20 10:23:59,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:59,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:59,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:59,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:59,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:59,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:59,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:59,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:59,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:59,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:59,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:23:59,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:59,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:59,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:59,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:59,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:59,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:23:59,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:59,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:59,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:23:59,871 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 [2019-01-20 10:23:59,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:23:59,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:23:59,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:23:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:23:59,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:00,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:00,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-01-20 10:24:00,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:00,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-20 10:24:00,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-20 10:24:00,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-01-20 10:24:00,156 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-01-20 10:24:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:00,420 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-20 10:24:00,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:24:00,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-01-20 10:24:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:00,421 INFO L225 Difference]: With dead ends: 20 [2019-01-20 10:24:00,422 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 10:24:00,423 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 [2019-01-20 10:24:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 10:24:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-20 10:24:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:24:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-20 10:24:00,427 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-01-20 10:24:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:00,427 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-20 10:24:00,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-20 10:24:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-20 10:24:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-20 10:24:00,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:00,428 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-01-20 10:24:00,428 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:00,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-01-20 10:24:00,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:00,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:00,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:00,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:00,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:00,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:00,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:00,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:00,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:00,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:00,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:00,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:00,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:00,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:00,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:00,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:00,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:00,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:01,083 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 [2019-01-20 10:24:01,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:01,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:01,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:01,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:01,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:01,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-01-20 10:24:01,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:01,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-20 10:24:01,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-20 10:24:01,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-01-20 10:24:01,571 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-01-20 10:24:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:02,030 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-20 10:24:02,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:24:02,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-01-20 10:24:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:02,032 INFO L225 Difference]: With dead ends: 22 [2019-01-20 10:24:02,032 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 10:24:02,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-01-20 10:24:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 10:24:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-20 10:24:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:24:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-20 10:24:02,038 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-01-20 10:24:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:02,039 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-20 10:24:02,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-20 10:24:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-20 10:24:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-20 10:24:02,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:02,040 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-01-20 10:24:02,040 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:02,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-01-20 10:24:02,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:02,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:02,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:02,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:02,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:02,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:02,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:02,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:02,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:02,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:02,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-20 10:24:02,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:02,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:02,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:02,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:02,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:02,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:02,661 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 [2019-01-20 10:24:02,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:02,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:02,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:02,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:03,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:03,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-01-20 10:24:03,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:03,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 10:24:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 10:24:03,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:24:03,151 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-01-20 10:24:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:03,475 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-20 10:24:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 10:24:03,476 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-01-20 10:24:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:03,477 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:24:03,477 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 10:24:03,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:24:03,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 10:24:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-20 10:24:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-20 10:24:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-20 10:24:03,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-01-20 10:24:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:03,484 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-20 10:24:03,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 10:24:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-20 10:24:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-20 10:24:03,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:03,485 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-01-20 10:24:03,485 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:03,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-01-20 10:24:03,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:03,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:03,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:03,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:03,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:03,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:03,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:03,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:03,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:03,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:03,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:03,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:03,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:03,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:03,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:03,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:03,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:03,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:03,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:04,179 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 [2019-01-20 10:24:04,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:04,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:04,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:04,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:04,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:04,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-01-20 10:24:04,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:04,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-20 10:24:04,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-20 10:24:04,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-01-20 10:24:04,595 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-01-20 10:24:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:04,868 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-20 10:24:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 10:24:04,868 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-01-20 10:24:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:04,869 INFO L225 Difference]: With dead ends: 26 [2019-01-20 10:24:04,870 INFO L226 Difference]: Without dead ends: 25 [2019-01-20 10:24:04,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-01-20 10:24:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-20 10:24:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-20 10:24:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 10:24:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-20 10:24:04,876 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-01-20 10:24:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:04,876 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-20 10:24:04,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-20 10:24:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-20 10:24:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-20 10:24:04,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:04,877 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-01-20 10:24:04,877 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-01-20 10:24:04,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:04,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:04,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:04,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:04,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:05,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:05,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:05,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:05,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:05,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:05,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:05,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:05,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:05,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:05,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:05,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:05,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:05,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:05,647 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 [2019-01-20 10:24:05,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:05,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:05,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:05,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:06,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:06,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-01-20 10:24:06,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:06,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 10:24:06,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 10:24:06,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 10:24:06,265 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-01-20 10:24:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:06,603 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-20 10:24:06,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 10:24:06,603 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-01-20 10:24:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:06,605 INFO L225 Difference]: With dead ends: 28 [2019-01-20 10:24:06,605 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 10:24:06,606 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 [2019-01-20 10:24:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 10:24:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-20 10:24:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:24:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-20 10:24:06,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-01-20 10:24:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:06,611 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-20 10:24:06,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 10:24:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-20 10:24:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-20 10:24:06,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:06,613 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-01-20 10:24:06,613 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-01-20 10:24:06,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:06,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:06,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:06,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:06,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:06,902 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:24:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:07,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:07,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:07,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:07,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:07,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:07,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:07,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:07,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:07,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-20 10:24:07,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:07,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:07,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:07,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:07,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:07,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:07,746 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 [2019-01-20 10:24:07,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:07,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:07,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:07,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:08,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:08,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-01-20 10:24:08,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:08,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 10:24:08,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 10:24:08,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-01-20 10:24:08,409 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-01-20 10:24:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:08,749 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-20 10:24:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 10:24:08,749 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-01-20 10:24:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:08,750 INFO L225 Difference]: With dead ends: 30 [2019-01-20 10:24:08,751 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 10:24:08,752 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 [2019-01-20 10:24:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 10:24:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-20 10:24:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 10:24:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-20 10:24:08,756 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-01-20 10:24:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:08,757 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-20 10:24:08,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 10:24:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-20 10:24:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-20 10:24:08,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:08,758 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-01-20 10:24:08,758 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-01-20 10:24:08,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:08,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:08,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:08,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:08,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:09,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:09,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:09,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:09,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:09,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:09,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:09,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:09,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:09,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:09,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:09,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:09,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:09,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:09,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:09,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:09,727 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 [2019-01-20 10:24:09,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:09,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:09,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:09,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:10,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:10,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-01-20 10:24:10,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:10,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-20 10:24:10,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-20 10:24:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 10:24:10,291 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-01-20 10:24:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:10,772 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-20 10:24:10,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 10:24:10,772 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-01-20 10:24:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:10,773 INFO L225 Difference]: With dead ends: 32 [2019-01-20 10:24:10,773 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 10:24:10,775 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 [2019-01-20 10:24:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 10:24:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-20 10:24:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:24:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-20 10:24:10,779 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-01-20 10:24:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:10,780 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-20 10:24:10,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-20 10:24:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-20 10:24:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-20 10:24:10,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:10,781 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-01-20 10:24:10,781 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-01-20 10:24:10,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:10,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:10,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:11,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:11,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:11,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:11,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:11,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:11,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:11,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:11,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:11,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:11,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:11,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:11,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:11,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:12,151 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 [2019-01-20 10:24:12,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:12,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:12,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:12,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:12,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:12,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-01-20 10:24:12,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:12,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-20 10:24:12,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-20 10:24:12,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-01-20 10:24:12,806 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-01-20 10:24:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:13,565 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-20 10:24:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 10:24:13,566 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-01-20 10:24:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:13,567 INFO L225 Difference]: With dead ends: 34 [2019-01-20 10:24:13,567 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 10:24:13,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-01-20 10:24:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 10:24:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-20 10:24:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:24:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-20 10:24:13,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-01-20 10:24:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:13,574 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-20 10:24:13,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-20 10:24:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-20 10:24:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-20 10:24:13,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:13,575 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-01-20 10:24:13,575 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:13,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-01-20 10:24:13,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:13,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:13,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:13,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:13,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:13,844 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:24:14,076 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:24:15,005 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-20 10:24:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:15,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:15,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:15,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:15,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:15,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:15,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:15,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:15,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:15,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-20 10:24:15,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:15,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:15,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:15,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:15,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:15,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:15,636 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 [2019-01-20 10:24:15,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:15,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:15,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:15,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:16,447 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-20 10:24:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:16,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:16,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-01-20 10:24:16,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:16,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 10:24:16,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 10:24:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 10:24:16,628 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-01-20 10:24:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:17,276 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-20 10:24:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 10:24:17,277 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-01-20 10:24:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:17,278 INFO L225 Difference]: With dead ends: 36 [2019-01-20 10:24:17,278 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:24:17,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 10:24:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:24:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-20 10:24:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-20 10:24:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-20 10:24:17,285 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-01-20 10:24:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:17,285 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-20 10:24:17,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 10:24:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-20 10:24:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-20 10:24:17,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:17,286 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-01-20 10:24:17,286 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-01-20 10:24:17,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:17,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:17,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:17,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:17,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:17,513 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:24:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:18,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:18,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:18,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:18,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:18,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:18,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:18,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:18,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:18,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:18,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:18,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:18,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:18,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:18,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:18,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:18,622 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 [2019-01-20 10:24:18,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:18,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:18,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:18,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:20,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:20,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-01-20 10:24:20,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:20,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-20 10:24:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-20 10:24:20,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-01-20 10:24:20,492 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-01-20 10:24:20,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:20,982 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-20 10:24:20,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 10:24:20,983 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-01-20 10:24:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:20,984 INFO L225 Difference]: With dead ends: 38 [2019-01-20 10:24:20,984 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 10:24:20,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-01-20 10:24:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 10:24:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-20 10:24:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:24:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-20 10:24:20,990 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-01-20 10:24:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:20,990 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-20 10:24:20,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-20 10:24:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-20 10:24:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-20 10:24:20,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:20,991 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-01-20 10:24:20,992 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:20,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:20,992 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-01-20 10:24:20,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:20,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:20,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:20,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:20,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:21,243 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:24:21,498 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:24:21,744 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:24:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:22,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:22,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:22,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:22,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:22,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:22,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:22,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:22,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:22,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:22,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:22,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:22,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:22,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:22,929 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 [2019-01-20 10:24:22,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:22,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:22,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:22,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:23,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:23,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-01-20 10:24:23,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:23,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-20 10:24:23,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-20 10:24:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 10:24:23,863 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-01-20 10:24:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:24,788 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-20 10:24:24,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 10:24:24,788 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-01-20 10:24:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:24,789 INFO L225 Difference]: With dead ends: 40 [2019-01-20 10:24:24,789 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 10:24:24,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 10:24:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 10:24:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-20 10:24:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:24:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-20 10:24:24,797 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-01-20 10:24:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:24,797 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-20 10:24:24,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-20 10:24:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-20 10:24:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-20 10:24:24,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:24,798 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-01-20 10:24:24,798 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-01-20 10:24:24,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:24,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:24,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:24,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:25,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:25,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:25,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:25,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:25,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:25,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:25,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:25,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:25,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-20 10:24:25,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:25,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:25,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 [2019-01-20 10:24:25,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:25,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:25,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:26,256 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 [2019-01-20 10:24:26,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:26,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:26,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:26,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:27,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:27,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-01-20 10:24:27,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:27,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 10:24:27,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 10:24:27,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-01-20 10:24:27,400 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-01-20 10:24:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:28,247 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-20 10:24:28,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 10:24:28,247 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-01-20 10:24:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:28,248 INFO L225 Difference]: With dead ends: 42 [2019-01-20 10:24:28,248 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 10:24:28,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-01-20 10:24:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 10:24:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-20 10:24:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:24:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-20 10:24:28,255 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-01-20 10:24:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:28,256 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-20 10:24:28,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 10:24:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-20 10:24:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-20 10:24:28,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:28,257 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-01-20 10:24:28,257 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-01-20 10:24:28,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:28,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:28,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:28,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:28,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:28,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:28,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:28,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:28,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:28,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:28,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:28,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:28,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:28,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:28,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:28,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:29,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:29,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:29,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:29,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:29,699 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 [2019-01-20 10:24:29,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:29,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:29,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:29,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:30,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-01-20 10:24:30,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:30,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-20 10:24:30,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-20 10:24:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 10:24:30,773 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-01-20 10:24:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:31,855 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-20 10:24:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 10:24:31,855 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-01-20 10:24:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:31,856 INFO L225 Difference]: With dead ends: 44 [2019-01-20 10:24:31,856 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 10:24:31,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 10:24:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 10:24:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-20 10:24:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 10:24:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-20 10:24:31,863 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-01-20 10:24:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:31,863 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-20 10:24:31,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-20 10:24:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-20 10:24:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-20 10:24:31,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:31,864 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-01-20 10:24:31,864 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:31,865 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-01-20 10:24:31,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:31,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:31,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:32,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:32,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:32,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:32,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:32,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:32,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:32,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:32,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:32,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:32,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:32,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:32,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:32,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:33,436 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 [2019-01-20 10:24:33,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:33,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:33,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:33,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:34,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-01-20 10:24:34,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:34,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-20 10:24:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-20 10:24:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-01-20 10:24:34,613 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-01-20 10:24:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:35,477 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-20 10:24:35,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 10:24:35,477 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-01-20 10:24:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:35,478 INFO L225 Difference]: With dead ends: 46 [2019-01-20 10:24:35,478 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 10:24:35,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-01-20 10:24:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 10:24:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-20 10:24:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-20 10:24:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-20 10:24:35,484 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-01-20 10:24:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:35,485 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-20 10:24:35,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-20 10:24:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-20 10:24:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-20 10:24:35,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:35,486 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-01-20 10:24:35,486 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-01-20 10:24:35,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:35,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:35,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:35,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:35,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:36,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:36,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:36,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:36,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:36,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:36,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:36,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:36,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:36,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-20 10:24:36,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:36,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:36,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 [2019-01-20 10:24:36,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:36,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:36,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:37,261 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 [2019-01-20 10:24:37,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:37,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:37,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:37,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:38,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:38,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-01-20 10:24:38,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:38,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:24:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:24:38,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:24:38,550 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-01-20 10:24:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:39,439 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-20 10:24:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 10:24:39,439 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-01-20 10:24:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:39,440 INFO L225 Difference]: With dead ends: 48 [2019-01-20 10:24:39,440 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 10:24:39,441 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 [2019-01-20 10:24:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 10:24:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-20 10:24:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 10:24:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-20 10:24:39,447 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-01-20 10:24:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:39,447 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-20 10:24:39,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:24:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-20 10:24:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-20 10:24:39,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:39,448 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-01-20 10:24:39,450 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-01-20 10:24:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:39,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:39,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:40,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:40,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:40,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:40,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:40,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:40,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:40,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:40,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:40,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:40,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:40,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:40,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:40,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:40,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:40,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:41,095 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 [2019-01-20 10:24:41,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:41,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:41,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:41,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:42,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:42,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-01-20 10:24:42,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:42,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-20 10:24:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-20 10:24:42,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-01-20 10:24:42,792 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-01-20 10:24:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:43,898 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-20 10:24:43,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 10:24:43,901 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-01-20 10:24:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:43,902 INFO L225 Difference]: With dead ends: 50 [2019-01-20 10:24:43,902 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 10:24:43,903 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 [2019-01-20 10:24:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 10:24:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-20 10:24:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 10:24:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-20 10:24:43,907 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-01-20 10:24:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:43,907 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-20 10:24:43,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-20 10:24:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-20 10:24:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-20 10:24:43,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:43,908 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-01-20 10:24:43,909 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-01-20 10:24:43,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:43,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:43,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:43,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:43,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:44,190 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:24:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:44,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:44,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:44,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:44,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:44,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:44,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:44,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:44,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:44,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:44,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:44,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:44,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:44,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:45,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 [2019-01-20 10:24:45,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:45,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:45,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:45,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:47,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:47,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-01-20 10:24:47,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:47,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-20 10:24:47,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-20 10:24:47,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 10:24:47,659 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-01-20 10:24:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:48,802 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-20 10:24:48,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 10:24:48,803 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-01-20 10:24:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:48,804 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:24:48,804 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:24:48,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 10:24:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:24:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-01-20 10:24:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-20 10:24:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-20 10:24:48,811 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-01-20 10:24:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:48,811 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-20 10:24:48,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-20 10:24:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-20 10:24:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-20 10:24:48,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:48,812 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-01-20 10:24:48,812 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-01-20 10:24:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:48,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:48,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:49,074 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:24:49,310 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-20 10:24:49,583 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:24:49,850 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:24:50,178 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:24:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:51,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:51,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:51,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:51,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:51,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:51,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:51,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:51,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:51,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-20 10:24:51,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:51,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:51,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:51,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:51,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:51,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:52,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 [2019-01-20 10:24:52,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:52,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:52,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:52,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:53,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-01-20 10:24:53,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:53,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 10:24:53,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 10:24:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-01-20 10:24:53,884 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-01-20 10:24:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:55,347 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-20 10:24:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 10:24:55,347 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-01-20 10:24:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:55,348 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:24:55,348 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:24:55,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-01-20 10:24:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:24:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-01-20 10:24:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 10:24:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-20 10:24:55,354 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-01-20 10:24:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:55,355 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-20 10:24:55,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 10:24:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-20 10:24:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-20 10:24:55,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:55,356 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-01-20 10:24:55,356 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-01-20 10:24:55,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:55,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:55,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:55,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:55,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:55,612 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:24:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:56,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:56,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:56,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:56,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:56,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:56,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:56,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:56,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:56,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:56,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:56,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:56,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:24:56,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:56,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:56,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:24:57,772 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 [2019-01-20 10:24:57,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:24:57,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:24:57,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:24:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:57,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:00,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:00,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-01-20 10:25:00,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:00,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 10:25:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 10:25:00,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 10:25:00,771 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-01-20 10:25:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:02,043 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-20 10:25:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 10:25:02,044 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-01-20 10:25:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:02,045 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:25:02,045 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:25:02,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 10:25:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:25:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-01-20 10:25:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-20 10:25:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-20 10:25:02,051 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-01-20 10:25:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:02,051 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-20 10:25:02,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 10:25:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-20 10:25:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-20 10:25:02,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:02,052 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-01-20 10:25:02,052 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-01-20 10:25:02,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:02,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:02,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:02,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:02,258 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:25:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:03,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:03,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:03,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:03,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:03,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:03,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:03,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:03,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:03,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:03,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:03,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:03,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:03,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:25:04,346 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 [2019-01-20 10:25:04,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:04,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:04,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:25:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:04,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:06,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:06,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-01-20 10:25:06,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:06,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-20 10:25:06,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-20 10:25:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-01-20 10:25:06,245 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-01-20 10:25:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:07,533 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-20 10:25:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 10:25:07,534 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-01-20 10:25:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:07,534 INFO L225 Difference]: With dead ends: 58 [2019-01-20 10:25:07,534 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:25:07,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-01-20 10:25:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:25:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-20 10:25:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 10:25:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-20 10:25:07,539 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-01-20 10:25:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:07,539 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-20 10:25:07,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-20 10:25:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-20 10:25:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 10:25:07,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:07,540 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-01-20 10:25:07,541 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-01-20 10:25:07,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:07,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:07,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:08,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:08,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:08,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:08,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:08,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:08,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:08,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:08,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:08,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-20 10:25:08,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:08,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:08,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:08,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:08,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:08,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:25:09,914 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 [2019-01-20 10:25:09,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:09,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:09,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:25:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:09,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:11,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:11,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-01-20 10:25:11,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:11,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 10:25:11,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 10:25:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 10:25:11,911 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-01-20 10:25:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:13,934 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-20 10:25:13,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 10:25:13,941 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-01-20 10:25:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:13,942 INFO L225 Difference]: With dead ends: 60 [2019-01-20 10:25:13,942 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 10:25:13,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 10:25:13,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 10:25:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-20 10:25:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 10:25:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-20 10:25:13,946 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-01-20 10:25:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:13,946 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-20 10:25:13,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 10:25:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-20 10:25:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-20 10:25:13,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:13,947 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-01-20 10:25:13,948 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-01-20 10:25:13,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:13,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:13,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:13,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:13,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:14,232 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:25:14,496 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:25:14,782 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:25:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:15,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:15,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:15,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:15,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:15,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:15,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:15,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:15,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:15,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:15,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:15,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:15,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:15,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:15,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:15,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:25:16,968 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 [2019-01-20 10:25:16,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:16,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:16,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:25:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:17,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:19,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:19,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-01-20 10:25:19,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:19,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-20 10:25:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-20 10:25:19,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-01-20 10:25:19,374 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-01-20 10:25:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:20,880 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-20 10:25:20,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 10:25:20,881 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-01-20 10:25:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:20,882 INFO L225 Difference]: With dead ends: 62 [2019-01-20 10:25:20,882 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 10:25:20,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-01-20 10:25:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 10:25:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-01-20 10:25:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-20 10:25:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-20 10:25:20,886 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-01-20 10:25:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:20,886 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-20 10:25:20,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-20 10:25:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-20 10:25:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-20 10:25:20,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:20,887 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-01-20 10:25:20,887 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:20,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-01-20 10:25:20,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:20,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:20,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:20,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:21,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:21,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:21,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:21,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:21,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:21,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:21,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:21,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:22,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:22,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:22,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:22,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:22,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:25:23,558 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 [2019-01-20 10:25:23,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:23,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:23,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:25:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:23,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:25,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:25,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-01-20 10:25:25,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:25,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-20 10:25:25,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-20 10:25:25,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:25:25,819 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-01-20 10:25:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:27,337 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-20 10:25:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 10:25:27,338 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-01-20 10:25:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:27,339 INFO L225 Difference]: With dead ends: 64 [2019-01-20 10:25:27,339 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 10:25:27,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:25:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 10:25:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-01-20 10:25:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-20 10:25:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-20 10:25:27,344 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-01-20 10:25:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:27,344 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-20 10:25:27,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-20 10:25:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-20 10:25:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-20 10:25:27,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:27,345 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-01-20 10:25:27,345 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-01-20 10:25:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:27,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:27,600 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:25:27,764 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:25:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:28,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:28,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:28,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:28,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:28,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:28,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:28,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:28,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:28,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-20 10:25:28,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:28,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:28,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:28,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:28,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:28,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:25:30,397 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 [2019-01-20 10:25:30,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:30,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:30,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:25:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:30,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:32,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:32,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-01-20 10:25:32,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:32,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:25:32,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:25:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-01-20 10:25:32,782 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-01-20 10:25:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:34,846 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-20 10:25:34,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 10:25:34,847 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-01-20 10:25:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:34,848 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:25:34,848 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:25:34,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-01-20 10:25:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:25:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-01-20 10:25:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 10:25:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-20 10:25:34,853 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-01-20 10:25:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:34,854 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-20 10:25:34,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:25:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-20 10:25:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-20 10:25:34,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:34,854 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-01-20 10:25:34,854 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-01-20 10:25:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:34,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:34,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:35,136 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:25:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:36,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:36,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:36,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:36,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:36,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:36,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:36,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:36,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:36,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:36,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:36,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:36,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:36,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:36,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:36,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:25:37,733 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 [2019-01-20 10:25:37,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:37,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:37,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:25:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:37,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:40,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:40,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-01-20 10:25:40,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:40,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-20 10:25:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-20 10:25:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 10:25:40,552 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-01-20 10:25:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:42,255 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-20 10:25:42,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 10:25:42,255 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-01-20 10:25:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:42,256 INFO L225 Difference]: With dead ends: 68 [2019-01-20 10:25:42,256 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:25:42,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 10:25:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:25:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-20 10:25:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 10:25:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-20 10:25:42,262 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-01-20 10:25:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:42,262 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-20 10:25:42,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-20 10:25:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-20 10:25:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-20 10:25:42,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:42,263 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-01-20 10:25:42,263 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-01-20 10:25:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:42,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:42,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:43,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:43,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:43,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:43,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:43,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:43,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:43,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:43,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:43,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:43,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:43,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:43,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:43,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:25:45,267 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 [2019-01-20 10:25:45,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:45,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:45,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:25:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:45,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:47,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:47,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-01-20 10:25:47,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:47,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-20 10:25:47,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-20 10:25:47,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-01-20 10:25:47,983 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-01-20 10:25:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:50,099 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-20 10:25:50,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 10:25:50,099 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-01-20 10:25:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:50,100 INFO L225 Difference]: With dead ends: 70 [2019-01-20 10:25:50,100 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:25:50,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-01-20 10:25:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:25:50,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-20 10:25:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:25:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-20 10:25:50,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-01-20 10:25:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:50,106 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-20 10:25:50,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-20 10:25:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-20 10:25:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-20 10:25:50,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:50,107 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-01-20 10:25:50,107 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:50,107 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-01-20 10:25:50,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:50,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:50,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:50,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:50,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:51,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:51,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:51,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:51,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:51,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:51,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:51,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:51,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-20 10:25:51,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:51,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:51,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:25:51,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:51,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:51,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:25:53,168 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 [2019-01-20 10:25:53,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:25:53,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:25:53,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:25:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:53,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:56,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:56,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-01-20 10:25:56,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:56,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:25:56,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:25:56,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:25:56,274 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-01-20 10:25:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:59,203 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-20 10:25:59,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 10:25:59,204 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-01-20 10:25:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:59,205 INFO L225 Difference]: With dead ends: 72 [2019-01-20 10:25:59,205 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:25:59,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:25:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:25:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-01-20 10:25:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-20 10:25:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-20 10:25:59,210 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-01-20 10:25:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:59,211 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-20 10:25:59,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:25:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-20 10:25:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-20 10:25:59,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:59,212 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-01-20 10:25:59,212 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-01-20 10:25:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:59,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:59,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:59,468 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:26:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:00,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:00,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:00,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:00,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:00,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:00,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:00,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:00,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:00,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:00,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:00,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:00,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:00,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:00,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:00,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:26:02,646 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 [2019-01-20 10:26:02,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:02,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:02,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:26:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:02,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-01-20 10:26:05,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:05,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-20 10:26:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-20 10:26:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-01-20 10:26:05,885 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-01-20 10:26:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:08,195 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-20 10:26:08,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 10:26:08,195 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-01-20 10:26:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:08,196 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:26:08,197 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:26:08,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-01-20 10:26:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:26:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-01-20 10:26:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-20 10:26:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-20 10:26:08,201 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-01-20 10:26:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:08,202 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-20 10:26:08,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-20 10:26:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-20 10:26:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-20 10:26:08,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:08,202 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-01-20 10:26:08,203 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-01-20 10:26:08,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:08,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:08,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:08,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:08,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:09,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:09,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:09,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:09,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:09,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:09,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:09,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:09,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:09,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:09,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:09,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:09,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:26:11,686 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 [2019-01-20 10:26:11,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:11,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:11,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:26:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:11,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:15,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:15,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-01-20 10:26:15,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:15,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-20 10:26:15,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-20 10:26:15,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 10:26:15,071 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-01-20 10:26:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:17,548 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-20 10:26:17,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 10:26:17,549 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-01-20 10:26:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:17,550 INFO L225 Difference]: With dead ends: 76 [2019-01-20 10:26:17,550 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:26:17,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 10:26:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:26:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-01-20 10:26:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:26:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-20 10:26:17,555 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-01-20 10:26:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:17,555 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-20 10:26:17,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-20 10:26:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-20 10:26:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-20 10:26:17,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:17,556 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-01-20 10:26:17,556 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-01-20 10:26:17,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:17,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:17,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:17,838 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:26:18,091 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:26:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:19,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:19,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:19,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:19,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:19,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:19,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:19,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:19,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:19,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-20 10:26:19,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:19,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:19,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:19,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:19,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:19,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:26:21,679 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 [2019-01-20 10:26:21,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:21,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:21,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:26:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:21,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:25,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:25,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-01-20 10:26:25,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:25,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:26:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:26:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-01-20 10:26:25,288 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-01-20 10:26:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:28,307 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-20 10:26:28,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 10:26:28,307 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-01-20 10:26:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:28,308 INFO L225 Difference]: With dead ends: 78 [2019-01-20 10:26:28,308 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:26:28,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-01-20 10:26:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:26:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-20 10:26:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 10:26:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-20 10:26:28,313 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-01-20 10:26:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:28,313 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-20 10:26:28,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:26:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-20 10:26:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-20 10:26:28,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:28,314 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-01-20 10:26:28,314 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:28,314 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-01-20 10:26:28,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:28,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:28,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:28,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:28,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:30,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:30,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:30,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:30,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:30,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:30,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:30,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:30,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:30,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:30,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:30,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:30,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:30,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:30,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:30,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:26:32,164 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 [2019-01-20 10:26:32,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:32,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:32,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:26:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:32,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:36,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:36,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-01-20 10:26:36,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:36,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-20 10:26:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-20 10:26:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:26:36,117 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-01-20 10:26:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:39,072 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-20 10:26:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 10:26:39,072 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-01-20 10:26:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:39,073 INFO L225 Difference]: With dead ends: 80 [2019-01-20 10:26:39,073 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 10:26:39,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:26:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 10:26:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-01-20 10:26:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:26:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-20 10:26:39,078 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-01-20 10:26:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:39,078 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-20 10:26:39,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-20 10:26:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-20 10:26:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-20 10:26:39,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:39,079 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-01-20 10:26:39,079 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-01-20 10:26:39,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:39,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:39,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:39,351 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:26:39,530 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:26:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:41,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:41,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:41,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:41,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:41,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:41,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:41,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:41,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:41,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:41,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:41,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:41,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:41,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:26:43,409 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 [2019-01-20 10:26:43,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:43,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:43,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:26:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:43,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:47,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:47,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-01-20 10:26:47,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:47,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-20 10:26:47,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-20 10:26:47,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-01-20 10:26:47,318 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-01-20 10:26:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:50,213 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-20 10:26:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 10:26:50,214 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-01-20 10:26:50,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:50,215 INFO L225 Difference]: With dead ends: 82 [2019-01-20 10:26:50,215 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 10:26:50,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-01-20 10:26:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 10:26:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-01-20 10:26:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 10:26:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-20 10:26:50,219 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-01-20 10:26:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:50,220 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-20 10:26:50,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-20 10:26:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-20 10:26:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-20 10:26:50,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:50,220 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-01-20 10:26:50,221 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:50,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:50,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-01-20 10:26:50,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:50,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:50,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:50,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:50,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:50,425 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:26:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:51,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:51,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:51,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:51,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:51,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:51,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:51,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:51,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:52,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-20 10:26:52,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:52,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:52,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:26:52,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:52,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:52,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:26:54,321 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 [2019-01-20 10:26:54,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:26:54,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:26:54,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:26:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:54,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:58,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:58,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-01-20 10:26:58,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:58,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 10:26:58,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 10:26:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:26:58,500 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-01-20 10:27:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:02,269 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-20 10:27:02,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 10:27:02,269 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-01-20 10:27:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:02,270 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:27:02,270 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:27:02,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:27:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:27:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-01-20 10:27:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-20 10:27:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-20 10:27:02,275 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-01-20 10:27:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:02,276 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-20 10:27:02,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 10:27:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-20 10:27:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-20 10:27:02,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:02,276 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-01-20 10:27:02,276 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-01-20 10:27:02,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:02,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:02,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:02,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:02,534 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:27:02,708 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:27:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:04,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:04,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:04,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:04,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:04,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:04,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:04,331 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:04,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:04,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:04,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:04,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:04,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:04,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:04,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:04,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:27:06,851 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 [2019-01-20 10:27:06,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:06,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:06,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:27:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:06,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:11,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:11,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-01-20 10:27:11,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:11,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-20 10:27:11,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-20 10:27:11,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-01-20 10:27:11,205 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-01-20 10:27:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:14,124 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-20 10:27:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 10:27:14,125 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-01-20 10:27:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:14,126 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:27:14,126 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:27:14,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-01-20 10:27:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:27:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-01-20 10:27:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:27:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-20 10:27:14,133 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-01-20 10:27:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:14,133 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-20 10:27:14,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-20 10:27:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-20 10:27:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-20 10:27:14,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:14,134 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-01-20 10:27:14,134 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:14,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-01-20 10:27:14,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:14,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:14,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:14,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:14,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:14,409 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:27:14,675 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:27:14,953 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:27:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:16,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:16,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:16,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:16,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:16,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:16,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:16,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:16,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:16,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:16,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:16,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:16,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:16,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:27:19,394 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 [2019-01-20 10:27:19,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:19,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:19,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:27:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:19,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:23,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:23,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-01-20 10:27:23,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:23,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-20 10:27:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-20 10:27:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:27:23,957 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-01-20 10:27:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:28,130 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-20 10:27:28,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 10:27:28,131 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-01-20 10:27:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:28,132 INFO L225 Difference]: With dead ends: 88 [2019-01-20 10:27:28,132 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:27:28,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:27:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:27:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-01-20 10:27:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-20 10:27:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-20 10:27:28,138 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-01-20 10:27:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:28,139 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-20 10:27:28,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-20 10:27:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-20 10:27:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-20 10:27:28,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:28,140 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-01-20 10:27:28,140 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-01-20 10:27:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:28,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:28,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:29,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:29,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:29,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:29,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:29,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:29,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:29,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:29,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:30,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-20 10:27:30,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:30,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:30,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:30,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:30,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:30,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:27:32,824 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 [2019-01-20 10:27:32,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:32,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:32,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:27:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:32,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:37,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:37,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-01-20 10:27:37,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:37,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:27:37,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:27:37,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-01-20 10:27:37,581 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-01-20 10:27:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:42,256 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-20 10:27:42,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 10:27:42,257 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-01-20 10:27:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:42,258 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:27:42,258 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:27:42,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-01-20 10:27:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:27:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-01-20 10:27:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-20 10:27:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-20 10:27:42,262 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-01-20 10:27:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:42,263 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-20 10:27:42,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:27:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-20 10:27:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-20 10:27:42,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:42,263 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-01-20 10:27:42,263 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-01-20 10:27:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:42,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:42,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:42,522 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:27:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:44,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:44,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:44,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:44,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:44,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:44,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:44,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:44,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:44,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:44,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:44,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:44,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:44,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:44,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:27:47,286 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 [2019-01-20 10:27:47,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:47,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:47,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:27:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:47,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:52,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:52,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-01-20 10:27:52,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:52,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-20 10:27:52,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-20 10:27:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:27:52,257 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-01-20 10:27:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:56,911 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-20 10:27:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 10:27:56,912 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-01-20 10:27:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:56,913 INFO L225 Difference]: With dead ends: 92 [2019-01-20 10:27:56,913 INFO L226 Difference]: Without dead ends: 91 [2019-01-20 10:27:56,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:27:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-20 10:27:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-01-20 10:27:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-20 10:27:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-20 10:27:56,919 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-01-20 10:27:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:56,919 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-20 10:27:56,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-20 10:27:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-20 10:27:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-20 10:27:56,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:56,920 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-01-20 10:27:56,920 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-01-20 10:27:56,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:56,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:56,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:58,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:58,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:58,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:58,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:58,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:58,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:58,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:58,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:58,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:58,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:27:58,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:58,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:58,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:28:01,738 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 [2019-01-20 10:28:01,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:01,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:01,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:28:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:01,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:06,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:06,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-01-20 10:28:06,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:06,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-20 10:28:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-20 10:28:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-01-20 10:28:06,776 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-01-20 10:28:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:10,534 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-20 10:28:10,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 10:28:10,535 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-01-20 10:28:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:10,536 INFO L225 Difference]: With dead ends: 94 [2019-01-20 10:28:10,536 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:28:10,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-01-20 10:28:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:28:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-01-20 10:28:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-20 10:28:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-20 10:28:10,541 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-01-20 10:28:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:10,541 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-20 10:28:10,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-20 10:28:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-20 10:28:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-20 10:28:10,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:10,542 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-01-20 10:28:10,542 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:10,542 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-01-20 10:28:10,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:10,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:10,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:10,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:10,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:10,774 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:28:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:12,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:12,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:12,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:12,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:12,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:12,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:12,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:12,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:13,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-20 10:28:13,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:13,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:13,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:28:13,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:13,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:13,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:28:16,271 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 [2019-01-20 10:28:16,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:16,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:16,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:28:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:16,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:21,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:21,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-01-20 10:28:21,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:21,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:28:21,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:28:21,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:28:21,542 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-01-20 10:28:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:25,718 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-20 10:28:25,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 10:28:25,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-01-20 10:28:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:25,720 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:28:25,720 INFO L226 Difference]: Without dead ends: 95 [2019-01-20 10:28:25,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:28:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-20 10:28:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-01-20 10:28:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-20 10:28:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-20 10:28:25,725 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-01-20 10:28:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:25,725 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-20 10:28:25,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:28:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-20 10:28:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-20 10:28:25,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:25,726 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-01-20 10:28:25,726 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:25,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:25,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-01-20 10:28:25,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:25,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:25,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:25,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:25,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:27,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:27,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:27,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:27,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:27,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:27,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:27,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:27,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:28,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:28,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:28,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:28,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:28:28,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:28,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:28,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:28:30,970 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 [2019-01-20 10:28:30,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:30,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:30,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:28:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:31,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:36,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:36,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-01-20 10:28:36,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:36,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-20 10:28:36,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-20 10:28:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-01-20 10:28:36,437 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-01-20 10:28:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:41,082 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-20 10:28:41,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 10:28:41,083 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-01-20 10:28:41,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:41,084 INFO L225 Difference]: With dead ends: 98 [2019-01-20 10:28:41,084 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:28:41,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-01-20 10:28:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:28:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-01-20 10:28:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:28:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-20 10:28:41,089 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-01-20 10:28:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:41,089 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-20 10:28:41,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-20 10:28:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-20 10:28:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-20 10:28:41,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:41,090 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-01-20 10:28:41,090 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-01-20 10:28:41,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:41,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:41,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:41,368 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:28:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:43,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:43,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:43,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:43,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:43,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:43,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:43,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:43,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:43,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:43,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:28:43,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:43,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:43,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:28:46,759 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 [2019-01-20 10:28:46,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:46,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:46,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:28:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:46,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:52,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:52,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-01-20 10:28:52,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:52,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-20 10:28:52,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-20 10:28:52,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:28:52,511 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-01-20 10:28:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:56,787 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-20 10:28:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 10:28:56,788 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-01-20 10:28:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:56,789 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:28:56,789 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:28:56,790 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 [2019-01-20 10:28:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:28:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-20 10:28:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:28:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-20 10:28:56,795 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-01-20 10:28:56,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:56,795 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-20 10:28:56,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-20 10:28:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-20 10:28:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-20 10:28:56,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:56,796 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-01-20 10:28:56,796 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-01-20 10:28:56,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:56,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:56,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:56,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:56,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:59,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:59,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:59,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:59,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:59,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:59,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:59,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:59,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:59,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-20 10:28:59,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:59,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:59,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:28:59,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:59,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:59,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:29:03,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 [2019-01-20 10:29:03,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:03,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:03,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:29:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:03,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:09,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:09,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-01-20 10:29:09,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:09,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:29:09,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:29:09,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-01-20 10:29:09,565 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-01-20 10:29:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:13,807 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-20 10:29:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 10:29:13,808 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-01-20 10:29:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:13,809 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:29:13,809 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:29:13,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-01-20 10:29:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:29:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-20 10:29:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-20 10:29:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-20 10:29:13,814 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-01-20 10:29:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:13,814 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-20 10:29:13,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:29:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-20 10:29:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-20 10:29:13,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:13,815 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-01-20 10:29:13,815 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-01-20 10:29:13,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:13,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:13,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:13,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:13,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:16,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:16,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:16,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:16,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:16,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:16,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:16,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:16,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:16,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:16,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:16,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:16,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:29:16,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:16,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:16,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:29:19,725 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 [2019-01-20 10:29:19,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:19,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:19,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:29:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:19,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:25,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:25,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-01-20 10:29:25,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:25,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-20 10:29:25,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-20 10:29:25,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:29:25,900 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-01-20 10:29:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:30,334 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-20 10:29:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 10:29:30,334 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-01-20 10:29:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:30,335 INFO L225 Difference]: With dead ends: 104 [2019-01-20 10:29:30,335 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:29:30,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:29:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:29:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-20 10:29:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-20 10:29:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-20 10:29:30,342 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-01-20 10:29:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:30,342 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-20 10:29:30,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-20 10:29:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-20 10:29:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-20 10:29:30,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:30,343 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-01-20 10:29:30,343 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:30,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:30,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-01-20 10:29:30,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:30,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:30,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:30,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:30,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:32,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:32,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:32,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:32,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:32,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:32,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:32,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:32,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:32,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:32,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:29:32,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:32,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:32,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:29:36,406 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 [2019-01-20 10:29:36,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:36,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:36,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:29:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:36,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:43,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:43,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-01-20 10:29:43,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:43,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-20 10:29:43,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-20 10:29:43,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-01-20 10:29:43,023 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-01-20 10:29:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:47,767 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-20 10:29:47,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 10:29:47,767 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-01-20 10:29:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:47,768 INFO L225 Difference]: With dead ends: 106 [2019-01-20 10:29:47,768 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:29:47,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-01-20 10:29:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:29:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-20 10:29:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-20 10:29:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-20 10:29:47,775 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-01-20 10:29:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:47,775 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-20 10:29:47,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-20 10:29:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-20 10:29:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-20 10:29:47,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:47,776 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-01-20 10:29:47,776 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-01-20 10:29:47,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:47,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:47,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:47,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:48,076 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:29:48,332 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:29:48,619 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:29:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:51,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:51,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:51,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:51,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:51,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:51,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:51,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:51,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:51,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-20 10:29:51,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:51,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:51,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:29:51,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:51,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:51,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:29:55,220 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 [2019-01-20 10:29:55,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:55,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:55,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:29:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:55,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:01,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-01-20 10:30:01,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:01,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:30:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:30:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:30:01,873 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-01-20 10:30:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:07,567 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-20 10:30:07,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 10:30:07,567 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-01-20 10:30:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:07,569 INFO L225 Difference]: With dead ends: 108 [2019-01-20 10:30:07,569 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:30:07,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:30:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:30:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-20 10:30:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-20 10:30:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-20 10:30:07,576 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-01-20 10:30:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:07,576 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-20 10:30:07,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:30:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-20 10:30:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-20 10:30:07,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:07,577 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-01-20 10:30:07,577 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-01-20 10:30:07,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:07,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:07,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:07,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:07,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:10,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:10,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:10,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:10,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:10,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:10,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:10,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:10,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:10,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:10,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:10,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:10,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:30:10,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:10,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:10,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:30:14,099 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 [2019-01-20 10:30:14,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:14,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:14,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:30:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:14,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:21,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:21,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-01-20 10:30:21,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:21,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-20 10:30:21,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-20 10:30:21,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-01-20 10:30:21,174 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-01-20 10:30:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:28,086 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-20 10:30:28,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 10:30:28,087 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-01-20 10:30:28,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:28,088 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:30:28,088 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:30:28,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-01-20 10:30:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:30:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-01-20 10:30:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-20 10:30:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-20 10:30:28,094 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-01-20 10:30:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:28,095 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-20 10:30:28,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-20 10:30:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-20 10:30:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-20 10:30:28,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:28,096 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-01-20 10:30:28,096 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-01-20 10:30:28,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:28,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:28,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:28,288 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:30:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:31,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:31,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:31,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:31,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:31,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:31,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:31,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:31,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:30:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:31,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:31,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:30:31,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:31,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:31,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:30:35,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 [2019-01-20 10:30:35,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:35,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:35,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:30:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:35,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:42,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:42,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-01-20 10:30:42,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:42,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-20 10:30:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-20 10:30:42,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:30:42,912 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-01-20 10:30:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:47,708 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-20 10:30:47,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 10:30:47,709 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-01-20 10:30:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:47,710 INFO L225 Difference]: With dead ends: 112 [2019-01-20 10:30:47,710 INFO L226 Difference]: Without dead ends: 111 [2019-01-20 10:30:47,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:30:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-20 10:30:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-01-20 10:30:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-20 10:30:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-20 10:30:47,716 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-01-20 10:30:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:47,716 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-20 10:30:47,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-20 10:30:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-20 10:30:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-20 10:30:47,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:47,717 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-01-20 10:30:47,717 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:47,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:47,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-01-20 10:30:47,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:47,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:47,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:47,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:47,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:48,012 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:30:48,253 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:30:48,529 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:30:48,815 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:30:49,123 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:30:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:51,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:51,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:51,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:51,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:51,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:51,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:51,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:51,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:51,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-20 10:30:51,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:51,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:51,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:30:51,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:51,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:51,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:30:56,170 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 [2019-01-20 10:30:56,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:56,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:56,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:30:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:56,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:03,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:03,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-01-20 10:31:03,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:03,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-20 10:31:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-20 10:31:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-01-20 10:31:03,601 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-01-20 10:31:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:10,106 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-20 10:31:10,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 10:31:10,107 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-01-20 10:31:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:10,108 INFO L225 Difference]: With dead ends: 114 [2019-01-20 10:31:10,108 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 10:31:10,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-01-20 10:31:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 10:31:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-01-20 10:31:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-20 10:31:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-20 10:31:10,115 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-01-20 10:31:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:10,115 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-20 10:31:10,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-20 10:31:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-20 10:31:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-20 10:31:10,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:10,116 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-01-20 10:31:10,116 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-01-20 10:31:10,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:10,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:10,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:10,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:13,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:13,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:13,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:13,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:13,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:13,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:13,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:31:13,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:31:13,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:31:13,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:13,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:13,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:31:13,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:13,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:13,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:31:17,629 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 [2019-01-20 10:31:17,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:17,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:17,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:31:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:17,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:25,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:25,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-01-20 10:31:25,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:25,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-01-20 10:31:25,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-01-20 10:31:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:31:25,343 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-01-20 10:31:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:30,368 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-20 10:31:30,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 10:31:30,368 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-01-20 10:31:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:30,370 INFO L225 Difference]: With dead ends: 116 [2019-01-20 10:31:30,370 INFO L226 Difference]: Without dead ends: 115 [2019-01-20 10:31:30,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:31:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-20 10:31:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-01-20 10:31:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-20 10:31:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-20 10:31:30,376 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-01-20 10:31:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:30,377 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-20 10:31:30,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-01-20 10:31:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-20 10:31:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-20 10:31:30,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:30,378 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-01-20 10:31:30,378 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-01-20 10:31:30,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:30,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:30,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:30,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:30,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:30,608 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:31:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:33,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:33,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:33,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:33,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:33,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:33,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:33,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:33,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:33,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:33,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:31:33,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:33,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:33,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:31:38,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 [2019-01-20 10:31:38,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:38,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:38,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:31:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:38,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:45,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:45,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-01-20 10:31:45,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:45,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-01-20 10:31:45,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-01-20 10:31:45,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:31:45,971 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-01-20 10:31:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:53,711 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-01-20 10:31:53,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 10:31:53,712 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-01-20 10:31:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:53,713 INFO L225 Difference]: With dead ends: 118 [2019-01-20 10:31:53,713 INFO L226 Difference]: Without dead ends: 117 [2019-01-20 10:31:53,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:31:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-20 10:31:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-01-20 10:31:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-20 10:31:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-20 10:31:53,719 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-01-20 10:31:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:53,719 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-20 10:31:53,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-01-20 10:31:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-20 10:31:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-20 10:31:53,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:53,720 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-01-20 10:31:53,720 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-01-20 10:31:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:53,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:53,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:53,970 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:31:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:56,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:56,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:56,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:56,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:56,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:56,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:56,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:31:56,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:31:56,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-20 10:31:56,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:56,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:56,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:31:56,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:56,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:57,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:32:01,557 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 [2019-01-20 10:32:01,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:01,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:01,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:32:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:01,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:09,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:09,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-01-20 10:32:09,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:09,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-20 10:32:09,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-20 10:32:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:32:09,964 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-01-20 10:32:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:16,093 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-20 10:32:16,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 10:32:16,093 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-01-20 10:32:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:16,094 INFO L225 Difference]: With dead ends: 120 [2019-01-20 10:32:16,094 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 10:32:16,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:32:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 10:32:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-01-20 10:32:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-20 10:32:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-01-20 10:32:16,100 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-01-20 10:32:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:16,100 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-01-20 10:32:16,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-20 10:32:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-01-20 10:32:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-20 10:32:16,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:16,101 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-01-20 10:32:16,101 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:16,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-01-20 10:32:16,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:16,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:16,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:16,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:16,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:16,332 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:32:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:19,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:19,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:19,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:19,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:19,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:19,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:19,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:32:19,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:32:19,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:32:19,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:19,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:19,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:32:19,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:19,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:19,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:32:24,497 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 [2019-01-20 10:32:24,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:24,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:24,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:32:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:24,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:32,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:32,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-01-20 10:32:32,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:32,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-01-20 10:32:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-01-20 10:32:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:32:32,992 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-01-20 10:32:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:38,635 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-01-20 10:32:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:32:38,635 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-01-20 10:32:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:38,637 INFO L225 Difference]: With dead ends: 122 [2019-01-20 10:32:38,637 INFO L226 Difference]: Without dead ends: 121 [2019-01-20 10:32:38,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:32:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-20 10:32:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-01-20 10:32:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-20 10:32:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-01-20 10:32:38,642 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-01-20 10:32:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:38,642 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-01-20 10:32:38,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-01-20 10:32:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-01-20 10:32:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-20 10:32:38,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:38,643 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-01-20 10:32:38,643 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:38,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-01-20 10:32:38,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:38,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:38,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:38,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:38,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:38,889 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:32:39,044 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:32:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:41,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:41,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:41,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:41,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:41,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:41,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:41,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:41,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:32:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:41,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:41,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:32:41,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:41,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:41,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:32:47,026 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 [2019-01-20 10:32:47,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:47,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:47,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:32:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:47,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:55,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:55,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-01-20 10:32:55,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:55,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-01-20 10:32:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-01-20 10:32:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:32:55,990 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-01-20 10:33:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:03,345 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-01-20 10:33:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:33:03,348 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-01-20 10:33:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:03,349 INFO L225 Difference]: With dead ends: 124 [2019-01-20 10:33:03,349 INFO L226 Difference]: Without dead ends: 123 [2019-01-20 10:33:03,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:33:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-20 10:33:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-01-20 10:33:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-20 10:33:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-20 10:33:03,355 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-01-20 10:33:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:03,355 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-20 10:33:03,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-01-20 10:33:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-20 10:33:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-20 10:33:03,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:03,356 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-01-20 10:33:03,356 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:03,357 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-01-20 10:33:03,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:03,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:03,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:03,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:03,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:03,563 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:33:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:06,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:06,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:06,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:06,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:06,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:06,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:06,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:33:06,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:33:06,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-20 10:33:06,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:06,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:06,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:33:06,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:06,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:06,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:33:12,172 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 [2019-01-20 10:33:12,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:12,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:12,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:33:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:12,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:21,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:21,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-01-20 10:33:21,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:21,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-20 10:33:21,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-20 10:33:21,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-01-20 10:33:21,379 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-01-20 10:33:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:30,458 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-20 10:33:30,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:33:30,458 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-01-20 10:33:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:30,459 INFO L225 Difference]: With dead ends: 126 [2019-01-20 10:33:30,459 INFO L226 Difference]: Without dead ends: 125 [2019-01-20 10:33:30,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-01-20 10:33:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-20 10:33:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-01-20 10:33:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-20 10:33:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-01-20 10:33:30,467 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-01-20 10:33:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:30,467 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-01-20 10:33:30,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-20 10:33:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-01-20 10:33:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-20 10:33:30,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:30,468 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-01-20 10:33:30,468 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-01-20 10:33:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:30,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:30,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:30,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:30,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:30,750 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:33:30,985 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:33:31,229 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:33:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:34,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:34,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:34,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:34,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:34,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:34,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:34,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:33:34,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:33:34,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:33:34,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:34,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:34,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:33:34,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:34,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:34,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:33:39,974 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 [2019-01-20 10:33:39,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:39,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:39,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:33:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:40,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:49,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:49,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-01-20 10:33:49,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:49,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-01-20 10:33:49,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-01-20 10:33:49,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:33:49,261 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-01-20 10:33:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:58,581 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-01-20 10:33:58,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:33:58,581 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-01-20 10:33:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:58,582 INFO L225 Difference]: With dead ends: 128 [2019-01-20 10:33:58,583 INFO L226 Difference]: Without dead ends: 127 [2019-01-20 10:33:58,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:33:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-20 10:33:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-20 10:33:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-20 10:33:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-20 10:33:58,588 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-01-20 10:33:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:58,588 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-20 10:33:58,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-01-20 10:33:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-20 10:33:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-20 10:33:58,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:58,589 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-01-20 10:33:58,589 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:58,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:58,589 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-01-20 10:33:58,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:58,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:58,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:58,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:58,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:02,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:02,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:02,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:02,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:02,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:02,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:02,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:02,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:34:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:02,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:02,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:34:02,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:02,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:02,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:34:07,540 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 [2019-01-20 10:34:07,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:07,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:07,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:34:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:07,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:17,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:17,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-01-20 10:34:17,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:17,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-01-20 10:34:17,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-01-20 10:34:17,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-01-20 10:34:17,144 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-01-20 10:34:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:24,990 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-20 10:34:24,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:34:24,990 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-01-20 10:34:24,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:24,991 INFO L225 Difference]: With dead ends: 130 [2019-01-20 10:34:24,991 INFO L226 Difference]: Without dead ends: 129 [2019-01-20 10:34:24,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-01-20 10:34:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-20 10:34:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-01-20 10:34:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-20 10:34:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-01-20 10:34:24,997 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-01-20 10:34:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:24,997 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-01-20 10:34:24,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-01-20 10:34:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-01-20 10:34:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-20 10:34:24,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:24,997 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-01-20 10:34:24,998 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:24,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:24,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-01-20 10:34:24,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:24,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:24,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:24,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:24,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:25,255 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:34:25,476 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:34:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:28,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:28,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:28,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:28,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:28,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:28,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:28,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:34:28,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:34:29,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-20 10:34:29,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:29,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:29,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:34:29,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:29,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:29,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:34:34,593 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 [2019-01-20 10:34:34,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:34,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:34,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:34:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:34,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:44,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-01-20 10:34:44,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:44,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-20 10:34:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-20 10:34:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:34:44,550 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-01-20 10:34:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:50,977 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-01-20 10:34:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:34:50,978 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-01-20 10:34:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:50,979 INFO L225 Difference]: With dead ends: 132 [2019-01-20 10:34:50,979 INFO L226 Difference]: Without dead ends: 131 [2019-01-20 10:34:50,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:34:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-20 10:34:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-01-20 10:34:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-20 10:34:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-01-20 10:34:50,985 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-01-20 10:34:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:50,985 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-01-20 10:34:50,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-20 10:34:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-01-20 10:34:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-20 10:34:50,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:50,986 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-01-20 10:34:50,986 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:50,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-01-20 10:34:50,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:50,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:50,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:50,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:50,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:54,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:54,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:54,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:54,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:54,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:54,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:54,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:34:54,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:34:54,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:34:54,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:54,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:54,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:34:54,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:54,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:54,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:35:00,393 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 [2019-01-20 10:35:00,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:00,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:00,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:35:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:00,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:10,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:10,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-01-20 10:35:10,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:10,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-01-20 10:35:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-01-20 10:35:10,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-01-20 10:35:10,746 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-01-20 10:35:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:18,965 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-01-20 10:35:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:35:18,965 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-01-20 10:35:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:18,967 INFO L225 Difference]: With dead ends: 134 [2019-01-20 10:35:18,967 INFO L226 Difference]: Without dead ends: 133 [2019-01-20 10:35:18,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-01-20 10:35:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-20 10:35:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-01-20 10:35:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-20 10:35:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-20 10:35:18,974 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-01-20 10:35:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:18,974 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-20 10:35:18,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-01-20 10:35:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-20 10:35:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-20 10:35:18,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:18,976 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-01-20 10:35:18,976 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-01-20 10:35:18,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:18,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:18,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:22,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:22,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:22,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:22,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:22,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:22,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:22,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:22,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:35:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:22,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:22,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:35:22,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:22,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:22,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:35:28,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 [2019-01-20 10:35:28,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:28,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:28,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:35:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:28,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:39,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:39,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-01-20 10:35:39,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:39,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-01-20 10:35:39,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-01-20 10:35:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:35:39,248 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-01-20 10:35:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:49,619 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-20 10:35:49,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:35:49,619 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-01-20 10:35:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:49,621 INFO L225 Difference]: With dead ends: 136 [2019-01-20 10:35:49,621 INFO L226 Difference]: Without dead ends: 135 [2019-01-20 10:35:49,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:35:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-20 10:35:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-01-20 10:35:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-20 10:35:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-01-20 10:35:49,626 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-01-20 10:35:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:49,627 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-01-20 10:35:49,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-01-20 10:35:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-01-20 10:35:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-20 10:35:49,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:49,628 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-01-20 10:35:49,628 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:49,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-01-20 10:35:49,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:49,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:49,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:49,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:49,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:53,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:53,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:53,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:53,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:53,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:53,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:53,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:35:53,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:35:53,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-20 10:35:53,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:53,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:53,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:35:53,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:53,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:53,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:36:01,278 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 [2019-01-20 10:36:01,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:01,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:01,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:36:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:01,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:12,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:12,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-01-20 10:36:12,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:12,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-20 10:36:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-20 10:36:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-01-20 10:36:12,257 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-01-20 10:36:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:19,528 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-01-20 10:36:19,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:36:19,529 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-01-20 10:36:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:19,530 INFO L225 Difference]: With dead ends: 138 [2019-01-20 10:36:19,530 INFO L226 Difference]: Without dead ends: 137 [2019-01-20 10:36:19,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-01-20 10:36:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-20 10:36:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-01-20 10:36:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-20 10:36:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-20 10:36:19,535 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-01-20 10:36:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:19,535 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-20 10:36:19,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-20 10:36:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-20 10:36:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-20 10:36:19,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:19,536 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-01-20 10:36:19,536 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-01-20 10:36:19,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:19,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:19,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:36:19,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:19,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:23,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:23,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:23,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:23,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:23,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:23,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:36:23,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:36:23,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:36:23,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:36:23,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:36:23,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:23,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-20 10:36:23,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:23,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:23,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-20 10:36:29,698 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 [2019-01-20 10:36:29,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:29,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:29,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-20 10:36:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:29,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:40,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:40,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-01-20 10:36:40,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:40,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-20 10:36:40,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-20 10:36:40,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:36:40,907 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states. [2019-01-20 10:36:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:51,279 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-20 10:36:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:36:51,279 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 135 [2019-01-20 10:36:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:51,280 INFO L225 Difference]: With dead ends: 140 [2019-01-20 10:36:51,280 INFO L226 Difference]: Without dead ends: 139 [2019-01-20 10:36:51,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9656 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:36:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-20 10:36:51,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-01-20 10:36:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-20 10:36:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-01-20 10:36:51,288 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-01-20 10:36:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:51,288 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-01-20 10:36:51,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-20 10:36:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-01-20 10:36:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-20 10:36:51,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:51,289 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-01-20 10:36:51,290 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:51,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:51,290 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-01-20 10:36:51,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:51,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:51,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:36:51,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:51,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat