java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:27:27,234 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:27:27,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:27:27,257 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:27:27,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:27:27,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:27:27,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:27:27,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:27:27,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:27:27,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:27:27,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:27:27,271 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:27:27,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:27:27,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:27:27,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:27:27,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:27:27,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:27:27,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:27:27,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:27:27,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:27:27,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:27:27,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:27:27,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:27:27,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:27:27,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:27:27,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:27:27,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:27:27,311 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:27:27,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:27:27,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:27:27,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:27:27,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:27:27,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:27:27,315 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:27:27,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:27:27,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:27:27,320 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-11 11:27:27,343 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:27:27,343 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:27:27,345 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:27:27,345 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:27:27,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:27:27,345 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:27:27,346 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:27:27,346 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:27:27,346 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:27:27,346 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 11:27:27,347 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 11:27:27,347 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:27:27,347 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:27:27,348 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:27:27,348 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:27:27,348 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:27:27,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:27:27,348 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:27:27,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:27:27,349 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:27:27,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:27:27,349 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:27:27,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:27:27,349 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:27:27,350 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:27:27,351 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:27:27,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:27:27,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:27:27,353 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:27:27,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:27:27,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:27:27,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:27:27,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:27:27,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:27:27,354 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:27:27,354 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:27:27,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:27:27,354 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:27:27,355 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:27:27,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:27:27,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:27:27,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:27:27,404 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:27:27,405 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:27:27,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2019-01-11 11:27:27,406 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-01-11 11:27:27,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:27:27,465 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:27:27,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:27:27,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:27:27,466 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:27:27,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:27:27,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:27:27,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:27:27,510 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:27:27,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/1) ... [2019-01-11 11:27:27,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:27:27,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:27:27,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:27:27,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:27:27,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:27:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:27:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:27:27,821 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:27:27,821 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-11 11:27:27,822 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:27:27 BoogieIcfgContainer [2019-01-11 11:27:27,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:27:27,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:27:27,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:27:27,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:27:27,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:27:27" (1/2) ... [2019-01-11 11:27:27,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843ec1d and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:27:27, skipping insertion in model container [2019-01-11 11:27:27,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:27:27" (2/2) ... [2019-01-11 11:27:27,830 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-01-11 11:27:27,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:27:27,850 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 11:27:27,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 11:27:27,907 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:27:27,907 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:27:27,908 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:27:27,908 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:27:27,908 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:27:27,908 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:27:27,908 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:27:27,908 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:27:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-11 11:27:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:27:27,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:27,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:27:27,933 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-11 11:27:27,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:27,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:27,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:27,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:28,088 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-11 11:27:28,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:27:28,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:27:28,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:27:28,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:27:28,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:27:28,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:27:28,130 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-11 11:27:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:28,247 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-11 11:27:28,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:27:28,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 11:27:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:28,259 INFO L225 Difference]: With dead ends: 10 [2019-01-11 11:27:28,260 INFO L226 Difference]: Without dead ends: 6 [2019-01-11 11:27:28,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:27:28,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-11 11:27:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-11 11:27:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 11:27:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-11 11:27:28,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-01-11 11:27:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:28,292 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-11 11:27:28,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:27:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-11 11:27:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:27:28,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:28,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:27:28,294 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-01-11 11:27:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:28,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:28,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:28,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:28,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:27:28,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:27:28,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:27:28,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:27:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:27:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:27:28,380 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-11 11:27:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:28,442 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-11 11:27:28,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:27:28,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:27:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:28,444 INFO L225 Difference]: With dead ends: 11 [2019-01-11 11:27:28,444 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 11:27:28,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:27:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 11:27:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 11:27:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 11:27:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-11 11:27:28,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-11 11:27:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:28,449 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-11 11:27:28,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:27:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-11 11:27:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:27:28,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:28,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:27:28,450 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-11 11:27:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:28,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:28,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:28,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:28,751 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-11 11:27:28,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:28,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:28,752 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:27:28,754 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-11 11:27:28,814 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:27:28,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:27:28,911 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-01-11 11:27:42,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:27:42,695 INFO L272 AbstractInterpreter]: Visited 6 different actions 118 times. Merged at 5 different actions 79 times. Widened at 4 different actions 52 times. Found 32 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:27:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:42,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:27:42,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:42,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 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-11 11:27:42,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:42,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:42,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:43,105 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-11 11:27:43,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:43,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:43,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:27:43,250 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-11 11:27:43,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:43,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:43,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:43,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:43,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:27:43,373 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-11 11:27:43,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:43,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-11 11:27:43,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:43,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:27:43,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:27:43,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:27:43,397 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-01-11 11:27:43,578 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-11 11:27:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:43,855 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-11 11:27:43,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:27:43,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:27:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:43,857 INFO L225 Difference]: With dead ends: 12 [2019-01-11 11:27:43,857 INFO L226 Difference]: Without dead ends: 8 [2019-01-11 11:27:43,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:27:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-11 11:27:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-11 11:27:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 11:27:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-11 11:27:43,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-01-11 11:27:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:43,861 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-11 11:27:43,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:27:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-11 11:27:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:27:43,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:43,862 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:27:43,862 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-01-11 11:27:43,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:43,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:43,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:44,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:44,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:44,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:44,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:44,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:44,030 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-11 11:27:44,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:44,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:44,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:27:44,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:44,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:44,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:44,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:44,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-01-11 11:27:44,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:44,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:27:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:27:44,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:27:44,355 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-01-11 11:27:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:44,680 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-11 11:27:44,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:27:44,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-11 11:27:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:44,682 INFO L225 Difference]: With dead ends: 11 [2019-01-11 11:27:44,682 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 11:27:44,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:27:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 11:27:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 11:27:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 11:27:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-11 11:27:44,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-01-11 11:27:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:44,686 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-11 11:27:44,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:27:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-11 11:27:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:27:44,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:44,687 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-11 11:27:44,687 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:44,688 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-01-11 11:27:44,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:44,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:44,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:44,840 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-11 11:27:44,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:44,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:44,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:44,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:44,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:44,842 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-11 11:27:44,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:44,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:44,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:44,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:44,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:44,928 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-11 11:27:44,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:44,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:44,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:27:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:27:44,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:45,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:45,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:45,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:45,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:27:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:27:45,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:45,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-01-11 11:27:45,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:45,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:27:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:27:45,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:27:45,210 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-01-11 11:27:45,775 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-11 11:27:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:45,967 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-11 11:27:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:27:45,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:27:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:45,968 INFO L225 Difference]: With dead ends: 17 [2019-01-11 11:27:45,968 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 11:27:45,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:27:45,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 11:27:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 11:27:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:27:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-11 11:27:45,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-11 11:27:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:45,973 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-11 11:27:45,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:27:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-11 11:27:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:27:45,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:45,974 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-11 11:27:45,975 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:45,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-01-11 11:27:45,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:45,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:45,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:45,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:45,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:46,153 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-11 11:27:46,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:46,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:46,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:46,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:46,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:46,154 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-11 11:27:46,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:46,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:46,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:46,353 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-11 11:27:46,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:46,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:46,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:27:46,380 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-11 11:27:46,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:46,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:46,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:46,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:46,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:27:46,421 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-11 11:27:46,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:46,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-01-11 11:27:46,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:46,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 11:27:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 11:27:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:27:46,442 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-01-11 11:27:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:46,806 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-11 11:27:46,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:27:46,807 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-01-11 11:27:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:46,808 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:27:46,808 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 11:27:46,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:27:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 11:27:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 11:27:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:27:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-11 11:27:46,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-01-11 11:27:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:46,813 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-11 11:27:46,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 11:27:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-11 11:27:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 11:27:46,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:46,814 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-01-11 11:27:46,814 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-01-11 11:27:46,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:46,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:46,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:46,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:46,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:46,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:46,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:46,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:46,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:46,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:46,893 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-11 11:27:46,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:46,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:46,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:27:46,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:46,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:46,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:47,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:47,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-11 11:27:47,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:47,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:27:47,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:27:47,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:27:47,300 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-01-11 11:27:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:47,362 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-11 11:27:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:27:47,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-11 11:27:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:47,363 INFO L225 Difference]: With dead ends: 15 [2019-01-11 11:27:47,363 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 11:27:47,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:27:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 11:27:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-11 11:27:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 11:27:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-11 11:27:47,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-01-11 11:27:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:47,369 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-11 11:27:47,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:27:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-11 11:27:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 11:27:47,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:47,370 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-11 11:27:47,370 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-01-11 11:27:47,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:47,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:47,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:47,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:47,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:47,562 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-11 11:27:47,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:47,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:47,562 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:47,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:47,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:47,563 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-11 11:27:47,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:47,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:47,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:47,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:47,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:47,682 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-11 11:27:47,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:47,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:47,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:27:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 11:27:47,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:47,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:47,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:47,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:47,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:27:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 11:27:47,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:47,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-01-11 11:27:47,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:47,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 11:27:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 11:27:47,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:27:47,933 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-01-11 11:27:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:48,454 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-11 11:27:48,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:27:48,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-01-11 11:27:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:48,455 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:27:48,455 INFO L226 Difference]: Without dead ends: 15 [2019-01-11 11:27:48,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-01-11 11:27:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-11 11:27:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-11 11:27:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 11:27:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-11 11:27:48,462 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-11 11:27:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:48,462 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-11 11:27:48,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 11:27:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-11 11:27:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 11:27:48,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:48,463 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-11 11:27:48,464 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:48,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-01-11 11:27:48,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:48,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:48,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:48,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:48,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:48,772 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-11 11:27:48,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:48,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:48,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:48,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:48,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:48,773 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-11 11:27:48,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:48,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:48,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:48,947 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-11 11:27:48,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:48,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:48,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:27:48,985 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-11 11:27:48,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:49,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:49,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:49,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:49,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:27:49,257 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-11 11:27:49,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:49,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-01-11 11:27:49,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:49,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 11:27:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 11:27:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:27:49,278 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-01-11 11:27:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:49,934 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-11 11:27:49,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 11:27:49,934 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-01-11 11:27:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:49,935 INFO L225 Difference]: With dead ends: 24 [2019-01-11 11:27:49,935 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 11:27:49,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:27:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 11:27:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-11 11:27:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:27:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-11 11:27:49,941 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-01-11 11:27:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:49,941 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-11 11:27:49,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 11:27:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-11 11:27:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 11:27:49,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:49,942 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-01-11 11:27:49,942 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:49,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-01-11 11:27:49,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:49,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:49,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:49,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:49,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:50,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:50,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:50,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:50,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:50,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:50,025 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-11 11:27:50,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:50,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:50,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:27:50,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:50,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:50,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:50,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:50,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-01-11 11:27:50,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:50,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:27:50,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:27:50,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:27:50,254 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-01-11 11:27:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:50,351 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-11 11:27:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:27:50,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-11 11:27:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:50,353 INFO L225 Difference]: With dead ends: 19 [2019-01-11 11:27:50,353 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:27:50,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:27:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:27:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 11:27:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:27:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-11 11:27:50,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-11 11:27:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:50,359 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-11 11:27:50,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:27:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-11 11:27:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 11:27:50,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:50,360 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-11 11:27:50,360 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:50,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:50,360 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-01-11 11:27:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:50,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:50,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:50,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:50,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:50,609 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-11 11:27:50,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:50,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:50,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:50,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:50,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:50,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:27:50,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:50,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:50,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:50,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:50,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:50,801 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-11 11:27:50,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:50,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:50,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:27:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 11:27:50,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:50,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:50,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:50,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:50,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:27:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 11:27:51,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:51,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-01-11 11:27:51,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:51,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 11:27:51,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 11:27:51,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:27:51,067 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-01-11 11:27:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:51,808 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-01-11 11:27:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:27:51,809 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-01-11 11:27:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:51,810 INFO L225 Difference]: With dead ends: 29 [2019-01-11 11:27:51,810 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 11:27:51,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:27:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 11:27:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-11 11:27:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 11:27:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-11 11:27:51,818 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-11 11:27:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:51,818 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-11 11:27:51,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 11:27:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-11 11:27:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 11:27:51,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:51,819 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-11 11:27:51,819 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:51,820 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-01-11 11:27:51,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:51,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:51,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:51,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:51,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:52,105 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-11 11:27:52,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:52,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:52,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:52,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:52,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:52,106 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-11 11:27:52,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:52,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:52,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:52,449 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-11 11:27:52,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:52,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:52,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:27:52,489 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-11 11:27:52,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:52,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:52,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:52,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:52,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:27:52,545 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-11 11:27:52,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:52,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-01-11 11:27:52,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:52,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 11:27:52,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 11:27:52,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-01-11 11:27:52,566 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-01-11 11:27:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:53,258 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-11 11:27:53,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 11:27:53,258 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-01-11 11:27:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:53,259 INFO L225 Difference]: With dead ends: 30 [2019-01-11 11:27:53,259 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:27:53,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:27:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:27:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-11 11:27:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 11:27:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-11 11:27:53,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-01-11 11:27:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:53,266 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-11 11:27:53,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 11:27:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-11 11:27:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 11:27:53,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:53,267 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-01-11 11:27:53,267 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-01-11 11:27:53,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:53,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:53,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:53,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:53,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:53,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:53,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:53,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:53,507 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-11 11:27:53,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:53,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:53,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-11 11:27:53,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:53,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:53,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:53,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:53,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-01-11 11:27:53,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:53,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:27:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:27:53,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:27:53,673 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-01-11 11:27:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:53,850 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-11 11:27:53,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:27:53,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-11 11:27:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:53,853 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:27:53,853 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 11:27:53,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:27:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 11:27:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-11 11:27:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:27:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-11 11:27:53,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-01-11 11:27:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:53,860 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-11 11:27:53,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:27:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-11 11:27:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 11:27:53,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:53,861 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-11 11:27:53,861 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:53,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:53,861 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-01-11 11:27:53,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:53,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:53,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:53,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:53,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:54,204 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-11 11:27:54,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:54,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:54,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:54,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:54,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:54,205 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-11 11:27:54,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:54,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:54,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:54,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:54,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:54,434 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-11 11:27:54,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:54,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:54,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:27:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-11 11:27:54,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:54,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:54,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:54,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:54,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:27:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-11 11:27:54,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:54,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-01-11 11:27:54,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:54,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 11:27:54,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 11:27:54,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:27:54,903 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-01-11 11:27:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:55,806 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-11 11:27:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:27:55,806 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-01-11 11:27:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:55,807 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:27:55,807 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 11:27:55,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-01-11 11:27:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 11:27:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-11 11:27:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:27:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-11 11:27:55,816 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-11 11:27:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:55,816 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-11 11:27:55,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 11:27:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-11 11:27:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 11:27:55,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:55,817 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-11 11:27:55,817 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-01-11 11:27:55,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:55,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:55,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:56,558 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-11 11:27:56,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:56,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:56,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:56,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:56,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:56,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 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-11 11:27:56,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:56,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:27:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:56,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:56,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:27:56,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:56,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:56,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:27:56,953 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-11 11:27:56,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:56,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:27:56,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:56,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:56,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:27:57,061 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-11 11:27:57,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:57,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-01-11 11:27:57,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:57,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 11:27:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 11:27:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:27:57,084 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-01-11 11:27:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:58,003 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-11 11:27:58,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 11:27:58,004 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-01-11 11:27:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:58,004 INFO L225 Difference]: With dead ends: 36 [2019-01-11 11:27:58,005 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:27:58,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:27:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:27:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-11 11:27:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 11:27:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-11 11:27:58,013 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-01-11 11:27:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:58,013 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-11 11:27:58,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 11:27:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-11 11:27:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 11:27:58,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:58,014 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-01-11 11:27:58,014 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:58,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-01-11 11:27:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:58,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:27:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:58,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:58,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:58,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:58,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:58,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:58,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:58,291 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-11 11:27:58,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:27:58,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:27:58,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 11:27:58,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:58,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:58,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:27:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:27:58,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:27:58,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-01-11 11:27:58,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:27:58,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:27:58,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:27:58,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:27:58,645 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-01-11 11:27:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:27:58,802 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-11 11:27:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 11:27:58,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-11 11:27:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:27:58,804 INFO L225 Difference]: With dead ends: 27 [2019-01-11 11:27:58,804 INFO L226 Difference]: Without dead ends: 25 [2019-01-11 11:27:58,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:27:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-11 11:27:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-11 11:27:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 11:27:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-11 11:27:58,814 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-01-11 11:27:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:27:58,815 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-11 11:27:58,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:27:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-11 11:27:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 11:27:58,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:27:58,816 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-11 11:27:58,816 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:27:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:27:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-01-11 11:27:58,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:27:58,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:58,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:27:58,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:27:58,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:27:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:27:59,524 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-11 11:27:59,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:59,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:27:59,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:27:59,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:27:59,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:27:59,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:27:59,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:27:59,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:27:59,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:27:59,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:27:59,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:27:59,880 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-11 11:27:59,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:27:59,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:27:59,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:27:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-11 11:27:59,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:00,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:00,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:00,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:00,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:28:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-11 11:28:00,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:00,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-01-11 11:28:00,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:00,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-11 11:28:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-11 11:28:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:28:00,663 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-01-11 11:28:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:02,278 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-11 11:28:02,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 11:28:02,279 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-01-11 11:28:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:02,280 INFO L225 Difference]: With dead ends: 41 [2019-01-11 11:28:02,280 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 11:28:02,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-01-11 11:28:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 11:28:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-11 11:28:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 11:28:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-11 11:28:02,292 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-11 11:28:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:02,292 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-11 11:28:02,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-11 11:28:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-11 11:28:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 11:28:02,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:02,293 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-11 11:28:02,293 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:02,294 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-01-11 11:28:02,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:02,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:02,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:02,694 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-11 11:28:02,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:02,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:02,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:02,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:02,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:02,695 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-11 11:28:02,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:02,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:02,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:03,228 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-11 11:28:03,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:03,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:03,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:28:03,270 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-11 11:28:03,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:03,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:03,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:03,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:03,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:28:03,406 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-11 11:28:03,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:03,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-01-11 11:28:03,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:03,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 11:28:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 11:28:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 11:28:03,425 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-01-11 11:28:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:04,589 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-11 11:28:04,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 11:28:04,589 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-01-11 11:28:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:04,590 INFO L225 Difference]: With dead ends: 42 [2019-01-11 11:28:04,590 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 11:28:04,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:28:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 11:28:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-11 11:28:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 11:28:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-11 11:28:04,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-01-11 11:28:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:04,602 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-11 11:28:04,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 11:28:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-11 11:28:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 11:28:04,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:04,602 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-01-11 11:28:04,602 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-01-11 11:28:04,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:04,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:04,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:04,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:04,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:04,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:04,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:04,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:28:04,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:04,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:04,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-11 11:28:04,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:04,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:04,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:04,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:04,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-01-11 11:28:04,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:04,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 11:28:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 11:28:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:28:04,987 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-01-11 11:28:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:05,222 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-11 11:28:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:28:05,222 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-11 11:28:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:05,223 INFO L225 Difference]: With dead ends: 31 [2019-01-11 11:28:05,223 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 11:28:05,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-01-11 11:28:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 11:28:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-11 11:28:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:28:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-11 11:28:05,232 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-01-11 11:28:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:05,232 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-11 11:28:05,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 11:28:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-11 11:28:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 11:28:05,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:05,233 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-11 11:28:05,233 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:05,234 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-01-11 11:28:05,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:05,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:05,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:05,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:05,741 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-11 11:28:05,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:05,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:05,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:05,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:05,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:05,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:28:05,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:05,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:05,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:05,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:05,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:07,657 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-11 11:28:07,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:07,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:07,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:28:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-11 11:28:07,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:07,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:07,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:07,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:07,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:28:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-11 11:28:08,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:08,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-01-11 11:28:08,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:08,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-11 11:28:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-11 11:28:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:28:08,324 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-01-11 11:28:09,424 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-11 11:28:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:10,727 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-11 11:28:10,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:28:10,727 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-01-11 11:28:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:10,728 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:28:10,728 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 11:28:10,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:28:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 11:28:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 11:28:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:28:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-11 11:28:10,740 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-11 11:28:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:10,740 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-11 11:28:10,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-11 11:28:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-11 11:28:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 11:28:10,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:10,741 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-11 11:28:10,742 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:10,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:10,742 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-01-11 11:28:10,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:10,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:10,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:11,933 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-11 11:28:11,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:11,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:11,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:11,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:11,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:11,934 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-11 11:28:11,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:11,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:11,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:12,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-11 11:28:12,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:12,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:12,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:28:12,598 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-11 11:28:12,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:12,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:12,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:12,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:12,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:28:12,739 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-11 11:28:12,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:12,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-01-11 11:28:12,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:12,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 11:28:12,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 11:28:12,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:28:12,762 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-01-11 11:28:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:14,023 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-11 11:28:14,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 11:28:14,023 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-01-11 11:28:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:14,024 INFO L225 Difference]: With dead ends: 48 [2019-01-11 11:28:14,024 INFO L226 Difference]: Without dead ends: 32 [2019-01-11 11:28:14,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:28:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-11 11:28:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-11 11:28:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:28:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-11 11:28:14,037 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-01-11 11:28:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:14,037 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-11 11:28:14,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 11:28:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-11 11:28:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 11:28:14,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:14,038 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-01-11 11:28:14,039 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-01-11 11:28:14,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:14,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:14,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:14,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:14,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:14,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:14,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:14,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:14,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:14,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:28:14,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:14,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:14,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-11 11:28:14,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:14,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:14,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:14,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:14,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-01-11 11:28:14,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:14,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 11:28:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 11:28:14,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:28:14,756 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-01-11 11:28:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:14,962 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-11 11:28:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:28:14,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-11 11:28:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:14,964 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:28:14,964 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 11:28:14,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-01-11 11:28:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 11:28:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-11 11:28:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:28:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-11 11:28:14,998 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-01-11 11:28:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:14,999 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-11 11:28:14,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 11:28:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-11 11:28:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 11:28:15,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:15,002 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-11 11:28:15,002 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-01-11 11:28:15,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:15,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:15,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:15,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:15,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:15,887 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-11 11:28:15,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:15,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:15,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:15,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:15,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:15,888 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-11 11:28:15,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:15,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:15,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:15,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:15,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:16,464 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-11 11:28:16,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:16,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:16,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:28:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 11:28:16,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:16,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:16,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:16,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:16,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:28:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 11:28:17,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:17,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-01-11 11:28:17,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:17,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:28:17,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:28:17,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:28:17,243 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-01-11 11:28:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:19,064 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-11 11:28:19,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:28:19,071 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-01-11 11:28:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:19,071 INFO L225 Difference]: With dead ends: 53 [2019-01-11 11:28:19,071 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 11:28:19,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2019-01-11 11:28:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 11:28:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-11 11:28:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 11:28:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-11 11:28:19,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-11 11:28:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:19,086 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-11 11:28:19,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:28:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-11 11:28:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 11:28:19,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:19,087 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-11 11:28:19,088 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-01-11 11:28:19,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:19,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:19,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:19,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:19,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:19,772 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-11 11:28:19,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:19,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:19,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:19,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:19,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:19,772 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-11 11:28:19,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:19,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:19,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:20,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:28:20,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:20,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:20,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:28:20,679 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-11 11:28:20,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:20,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:20,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:20,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:20,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:28:20,895 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-11 11:28:20,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:20,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-01-11 11:28:20,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:20,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 11:28:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 11:28:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 11:28:20,915 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-01-11 11:28:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:22,660 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-11 11:28:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:28:22,660 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-01-11 11:28:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:22,661 INFO L225 Difference]: With dead ends: 54 [2019-01-11 11:28:22,661 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 11:28:22,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:28:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 11:28:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-11 11:28:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:28:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-11 11:28:22,676 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-01-11 11:28:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:22,676 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-11 11:28:22,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 11:28:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-11 11:28:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 11:28:22,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:22,677 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-01-11 11:28:22,677 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:22,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-01-11 11:28:22,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:22,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:22,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:23,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:23,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:23,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:23,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:23,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:23,232 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-11 11:28:23,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:23,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:23,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 11:28:23,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:23,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:23,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:23,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:23,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-01-11 11:28:23,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:23,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-11 11:28:23,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-11 11:28:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:28:23,545 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-01-11 11:28:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:23,774 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-11 11:28:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:28:23,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-01-11 11:28:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:23,774 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:28:23,775 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 11:28:23,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:28:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 11:28:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-11 11:28:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:28:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-11 11:28:23,791 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-01-11 11:28:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:23,791 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-11 11:28:23,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-11 11:28:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-11 11:28:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 11:28:23,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:23,792 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-11 11:28:23,793 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-01-11 11:28:23,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:23,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:23,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:23,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:23,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:24,812 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-11 11:28:24,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:24,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:24,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:24,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:24,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:24,813 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-11 11:28:24,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:24,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:24,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:24,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:24,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:25,562 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-11 11:28:25,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:25,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:25,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:28:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-11 11:28:25,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:25,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:25,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:25,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:25,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:28:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-11 11:28:26,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:26,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-01-11 11:28:26,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:26,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 11:28:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 11:28:26,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:28:26,711 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-01-11 11:28:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:29,052 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-11 11:28:29,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 11:28:29,053 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-01-11 11:28:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:29,053 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:28:29,054 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 11:28:29,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-01-11 11:28:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 11:28:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-11 11:28:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:28:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-11 11:28:29,073 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-11 11:28:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:29,073 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-11 11:28:29,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 11:28:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-11 11:28:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-11 11:28:29,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:29,074 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-11 11:28:29,075 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-01-11 11:28:29,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:29,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:29,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:30,091 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-11 11:28:30,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:30,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:30,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:30,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:30,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:30,092 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-11 11:28:30,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:30,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:30,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:31,334 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-11 11:28:31,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:31,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:31,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:28:31,390 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-11 11:28:31,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:31,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:31,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:31,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:31,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:28:31,696 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-11 11:28:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-01-11 11:28:31,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:31,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 11:28:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 11:28:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 11:28:31,717 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-01-11 11:28:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:33,818 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-11 11:28:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 11:28:33,818 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-01-11 11:28:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:33,819 INFO L225 Difference]: With dead ends: 60 [2019-01-11 11:28:33,819 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 11:28:33,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:28:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 11:28:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-11 11:28:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 11:28:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-11 11:28:33,847 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-01-11 11:28:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:33,847 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-11 11:28:33,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 11:28:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-11 11:28:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 11:28:33,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:33,848 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-01-11 11:28:33,848 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-01-11 11:28:33,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:33,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:33,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:34,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:34,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:34,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:34,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:34,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:34,109 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-11 11:28:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:34,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:34,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-11 11:28:34,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:34,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:34,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:34,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:34,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-01-11 11:28:34,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:34,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-11 11:28:34,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-11 11:28:34,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:28:34,673 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-01-11 11:28:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:34,941 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-11 11:28:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:28:34,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-11 11:28:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:34,942 INFO L225 Difference]: With dead ends: 43 [2019-01-11 11:28:34,942 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 11:28:34,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-01-11 11:28:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 11:28:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-11 11:28:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:28:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-11 11:28:34,957 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-01-11 11:28:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:34,958 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-11 11:28:34,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-11 11:28:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-11 11:28:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 11:28:34,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:34,958 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-11 11:28:34,958 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:34,959 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-01-11 11:28:34,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:34,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:34,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:36,678 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-11 11:28:36,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:36,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:36,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:36,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:36,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:36,679 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-11 11:28:36,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:36,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:36,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:36,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:36,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:37,554 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-11 11:28:37,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:37,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:37,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:28:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-11 11:28:37,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:37,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:37,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:37,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:37,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:28:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-11 11:28:38,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:38,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-01-11 11:28:38,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:38,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 11:28:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 11:28:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:28:38,727 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-01-11 11:28:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:41,555 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-11 11:28:41,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:28:41,555 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-01-11 11:28:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:41,556 INFO L225 Difference]: With dead ends: 65 [2019-01-11 11:28:41,556 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 11:28:41,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:28:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 11:28:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-11 11:28:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-11 11:28:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-11 11:28:41,580 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-11 11:28:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:41,580 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-11 11:28:41,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 11:28:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-11 11:28:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 11:28:41,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:41,581 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-11 11:28:41,581 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-01-11 11:28:41,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:41,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:41,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:42,488 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-11 11:28:42,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:42,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:42,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:42,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:42,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:42,489 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-11 11:28:42,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:42,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:42,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:43,528 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-11 11:28:43,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:43,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:43,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:28:43,602 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-11 11:28:43,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:43,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:43,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:43,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:43,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:28:43,928 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-11 11:28:43,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:43,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-01-11 11:28:43,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:43,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 11:28:43,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 11:28:43,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 11:28:43,948 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-01-11 11:28:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:46,656 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-11 11:28:46,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 11:28:46,656 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-01-11 11:28:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:46,656 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:28:46,657 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:28:46,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:28:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:28:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-11 11:28:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-11 11:28:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-11 11:28:46,679 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-01-11 11:28:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:46,680 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-11 11:28:46,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 11:28:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-11 11:28:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 11:28:46,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:46,680 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-01-11 11:28:46,681 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-01-11 11:28:46,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:46,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:46,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:46,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:46,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:47,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:47,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:47,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:47,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:47,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:47,400 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-11 11:28:47,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:28:47,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:28:47,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-11 11:28:47,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:47,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:47,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:28:47,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:47,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-01-11 11:28:47,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:47,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 11:28:47,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 11:28:47,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:28:47,857 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-01-11 11:28:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:48,162 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-11 11:28:48,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 11:28:48,162 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-11 11:28:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:48,163 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:28:48,163 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:28:48,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-01-11 11:28:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:28:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-11 11:28:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 11:28:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-11 11:28:48,183 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-01-11 11:28:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:48,183 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-11 11:28:48,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 11:28:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-11 11:28:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 11:28:48,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:48,183 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-11 11:28:48,183 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-01-11 11:28:48,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:48,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:48,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:48,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:48,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:49,256 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-11 11:28:49,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:49,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:49,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:49,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:49,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:49,256 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-11 11:28:49,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:28:49,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:28:49,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:28:49,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:28:49,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:50,325 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-11 11:28:50,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:50,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:50,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:28:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-11 11:28:50,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:50,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:50,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:50,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:50,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:28:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-11 11:28:51,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:51,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-01-11 11:28:51,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:51,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 11:28:51,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 11:28:51,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:28:51,843 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-01-11 11:28:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:28:55,200 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-11 11:28:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:28:55,200 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-01-11 11:28:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:28:55,201 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:28:55,201 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 11:28:55,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2019-01-11 11:28:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 11:28:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-11 11:28:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:28:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-11 11:28:55,220 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-11 11:28:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:28:55,220 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-11 11:28:55,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 11:28:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-11 11:28:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-11 11:28:55,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:28:55,221 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-11 11:28:55,221 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:28:55,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:28:55,222 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-01-11 11:28:55,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:28:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:55,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:28:55,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:28:55,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:28:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:56,564 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-11 11:28:56,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:56,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:28:56,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:28:56,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:28:56,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:28:56,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:28:56,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:28:56,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:28:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:28:56,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:28:57,805 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-11 11:28:57,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:57,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:57,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:28:57,978 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-11 11:28:57,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:28:57,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:28:57,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:28:57,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:28:57,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:28:58,417 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-11 11:28:58,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:28:58,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-01-11 11:28:58,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:28:58,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 11:28:58,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 11:28:58,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:28:58,437 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-01-11 11:29:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:01,559 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-11 11:29:01,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 11:29:01,559 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-01-11 11:29:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:01,560 INFO L225 Difference]: With dead ends: 72 [2019-01-11 11:29:01,560 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 11:29:01,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:29:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 11:29:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-11 11:29:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:29:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-11 11:29:01,578 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-01-11 11:29:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:01,579 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-11 11:29:01,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 11:29:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-11 11:29:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-11 11:29:01,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:01,579 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-01-11 11:29:01,579 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:01,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-01-11 11:29:01,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:01,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:01,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:01,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:01,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:01,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:01,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:01,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:01,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:01,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:01,969 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-11 11:29:01,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:29:01,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:29:02,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-11 11:29:02,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:02,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:02,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:02,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:02,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-01-11 11:29:02,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:02,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-11 11:29:02,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-11 11:29:02,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-01-11 11:29:02,483 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-01-11 11:29:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:02,838 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-11 11:29:02,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:29:02,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-01-11 11:29:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:02,839 INFO L225 Difference]: With dead ends: 51 [2019-01-11 11:29:02,839 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 11:29:02,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:29:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 11:29:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-11 11:29:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 11:29:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-11 11:29:02,859 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-01-11 11:29:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:02,860 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-11 11:29:02,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-11 11:29:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-11 11:29:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 11:29:02,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:02,861 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-11 11:29:02,861 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-01-11 11:29:02,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:02,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:02,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:04,156 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-11 11:29:04,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:04,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:04,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:04,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:04,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:04,157 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-11 11:29:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:29:04,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:29:04,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:29:04,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:04,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:05,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:29:05,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:05,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:05,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:29:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-11 11:29:05,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:05,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:29:05,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:05,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:05,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:29:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-11 11:29:07,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:07,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-01-11 11:29:07,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:07,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 11:29:07,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 11:29:07,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:29:07,344 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-01-11 11:29:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:11,208 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-11 11:29:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 11:29:11,208 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-01-11 11:29:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:11,209 INFO L225 Difference]: With dead ends: 77 [2019-01-11 11:29:11,209 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 11:29:11,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-01-11 11:29:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 11:29:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-11 11:29:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:29:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-11 11:29:11,231 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-11 11:29:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:11,231 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-11 11:29:11,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 11:29:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-11 11:29:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 11:29:11,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:11,232 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-11 11:29:11,232 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-01-11 11:29:11,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:11,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:11,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:12,782 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-11 11:29:12,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:12,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:12,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:12,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:12,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:12,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 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-11 11:29:12,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:12,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:29:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:12,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:14,218 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-11 11:29:14,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:14,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:14,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:29:14,292 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-11 11:29:14,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:14,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:29:14,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:14,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:14,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:29:14,795 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-11 11:29:14,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:14,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-01-11 11:29:14,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:14,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 11:29:14,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 11:29:14,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 11:29:14,815 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-01-11 11:29:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:18,022 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-11 11:29:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 11:29:18,022 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-01-11 11:29:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:18,023 INFO L225 Difference]: With dead ends: 78 [2019-01-11 11:29:18,023 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 11:29:18,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:29:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 11:29:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-11 11:29:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 11:29:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-11 11:29:18,045 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-01-11 11:29:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:18,045 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-11 11:29:18,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 11:29:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-11 11:29:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 11:29:18,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:18,046 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-01-11 11:29:18,046 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:18,046 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-01-11 11:29:18,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:18,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:18,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:18,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:18,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:18,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:18,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:18,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:18,472 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-11 11:29:18,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:29:18,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:29:18,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-11 11:29:18,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:18,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:18,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:19,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:19,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-01-11 11:29:19,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:19,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-11 11:29:19,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-11 11:29:19,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-01-11 11:29:19,049 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-01-11 11:29:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:19,436 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-11 11:29:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 11:29:19,437 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-01-11 11:29:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:19,437 INFO L225 Difference]: With dead ends: 55 [2019-01-11 11:29:19,438 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:29:19,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-01-11 11:29:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:29:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-11 11:29:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 11:29:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-11 11:29:19,459 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-01-11 11:29:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:19,459 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-11 11:29:19,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-11 11:29:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-11 11:29:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 11:29:19,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:19,460 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-11 11:29:19,460 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:19,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-01-11 11:29:19,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:19,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:19,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:19,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:19,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:20,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-11 11:29:20,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:20,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:20,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:20,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:20,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:20,849 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-11 11:29:20,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:29:20,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:29:20,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:29:20,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:20,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:22,617 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-11 11:29:22,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:22,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:22,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:29:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-11 11:29:22,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:22,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:29:22,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:22,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:22,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:29:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-11 11:29:24,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:24,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-01-11 11:29:24,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:24,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 11:29:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 11:29:24,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:29:24,486 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-01-11 11:29:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:28,863 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-01-11 11:29:28,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 11:29:28,863 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-01-11 11:29:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:28,864 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:29:28,864 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:29:28,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-01-11 11:29:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:29:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-11 11:29:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 11:29:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-11 11:29:28,894 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-11 11:29:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:28,894 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-11 11:29:28,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 11:29:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-11 11:29:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 11:29:28,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:28,895 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-11 11:29:28,895 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:28,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-01-11 11:29:28,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:28,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:28,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:30,465 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-11 11:29:30,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:30,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:30,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:30,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:30,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:30,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:29:30,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:30,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:29:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:30,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:32,199 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-11 11:29:32,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:32,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:32,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:29:32,282 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-11 11:29:32,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:32,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:29:32,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:32,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:32,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:29:33,015 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-11 11:29:33,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:33,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-01-11 11:29:33,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:33,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 11:29:33,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 11:29:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 11:29:33,036 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-01-11 11:29:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:36,914 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-01-11 11:29:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 11:29:36,915 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-01-11 11:29:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:36,916 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:29:36,916 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 11:29:36,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:29:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 11:29:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-11 11:29:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 11:29:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-11 11:29:36,940 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-01-11 11:29:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:36,940 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-11 11:29:36,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 11:29:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-11 11:29:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 11:29:36,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:36,941 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-01-11 11:29:36,941 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-01-11 11:29:36,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:36,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:36,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:36,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:36,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:37,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:37,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:37,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:37,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:37,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:37,603 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-11 11:29:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:29:37,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:29:37,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-11 11:29:37,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:37,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:37,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:29:38,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:38,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-01-11 11:29:38,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:38,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 11:29:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 11:29:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:29:38,334 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-01-11 11:29:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:38,803 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-11 11:29:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:29:38,804 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-01-11 11:29:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:38,805 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:29:38,805 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 11:29:38,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-01-11 11:29:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 11:29:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-11 11:29:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 11:29:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-11 11:29:38,831 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-01-11 11:29:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:38,832 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-11 11:29:38,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 11:29:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-11 11:29:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 11:29:38,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:38,832 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-11 11:29:38,833 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:38,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:38,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-01-11 11:29:38,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:38,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:38,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:40,542 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-11 11:29:40,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:40,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:40,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:40,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:40,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:40,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:29:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:29:40,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:29:40,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:29:40,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:29:40,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:42,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-11 11:29:42,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:42,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:42,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:29:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-11 11:29:42,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:42,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:29:42,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:42,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:42,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:29:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-11 11:29:44,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:44,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-01-11 11:29:44,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:44,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-11 11:29:44,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-11 11:29:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:29:44,726 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-01-11 11:29:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:49,882 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-11 11:29:49,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 11:29:49,882 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-01-11 11:29:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:49,883 INFO L225 Difference]: With dead ends: 89 [2019-01-11 11:29:49,883 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 11:29:49,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2019-01-11 11:29:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 11:29:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-11 11:29:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 11:29:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-11 11:29:49,909 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-11 11:29:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:49,909 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-11 11:29:49,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-11 11:29:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-11 11:29:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 11:29:49,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:49,910 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-11 11:29:49,910 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:49,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-01-11 11:29:49,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:49,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:49,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:29:49,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:49,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:51,647 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-11 11:29:51,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:51,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:29:51,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:29:51,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:29:51,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:29:51,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 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-11 11:29:51,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:51,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:29:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:29:51,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:29:53,848 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-11 11:29:53,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:53,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:53,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:29:53,930 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-11 11:29:53,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:29:53,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:29:53,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:29:53,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:29:53,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:29:54,650 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-11 11:29:54,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:29:54,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-01-11 11:29:54,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:29:54,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 11:29:54,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 11:29:54,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 11:29:54,670 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-01-11 11:29:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:29:59,181 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-11 11:29:59,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 11:29:59,181 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-01-11 11:29:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:29:59,182 INFO L225 Difference]: With dead ends: 90 [2019-01-11 11:29:59,182 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 11:29:59,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:29:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 11:29:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-11 11:29:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-11 11:29:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-11 11:29:59,211 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-01-11 11:29:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:29:59,211 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-11 11:29:59,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 11:29:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-11 11:29:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-11 11:29:59,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:29:59,212 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-01-11 11:29:59,212 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:29:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:29:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-01-11 11:29:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:29:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:59,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:29:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:29:59,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:29:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:00,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:00,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:00,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:00,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:00,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:00,085 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-11 11:30:00,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:30:00,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:30:00,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 11:30:00,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:00,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:00,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:00,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:00,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-01-11 11:30:00,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:00,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-11 11:30:00,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-11 11:30:00,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-01-11 11:30:00,911 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-01-11 11:30:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:01,406 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-11 11:30:01,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:30:01,406 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-01-11 11:30:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:01,407 INFO L225 Difference]: With dead ends: 63 [2019-01-11 11:30:01,407 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 11:30:01,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:30:01,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 11:30:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-11 11:30:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:30:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-11 11:30:01,437 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-01-11 11:30:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:01,437 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-11 11:30:01,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-11 11:30:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-11 11:30:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 11:30:01,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:01,438 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-11 11:30:01,438 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-01-11 11:30:01,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:01,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:01,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:01,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:01,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:03,468 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-11 11:30:03,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:03,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:03,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:03,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:03,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:03,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:30:03,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:30:03,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:30:03,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:30:03,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:03,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:05,518 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-11 11:30:05,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:30:05,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:30:05,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:30:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-11 11:30:05,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:05,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:30:05,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:30:05,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:30:05,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:30:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-11 11:30:08,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:08,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-01-11 11:30:08,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:08,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 11:30:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 11:30:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:30:08,068 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-01-11 11:30:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:13,689 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-11 11:30:13,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-11 11:30:13,690 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-01-11 11:30:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:13,690 INFO L225 Difference]: With dead ends: 95 [2019-01-11 11:30:13,691 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 11:30:13,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-01-11 11:30:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 11:30:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-11 11:30:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 11:30:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-11 11:30:13,722 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-11 11:30:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:13,723 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-11 11:30:13,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 11:30:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-11 11:30:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-11 11:30:13,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:13,723 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-11 11:30:13,724 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-01-11 11:30:13,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:13,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:13,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:13,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:13,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:16,386 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-11 11:30:16,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:16,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:16,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:16,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:16,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:16,387 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-11 11:30:16,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:16,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:30:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:16,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:18,791 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-11 11:30:18,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:30:18,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:30:18,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:30:18,878 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-11 11:30:18,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:18,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:30:18,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:30:18,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:30:18,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:30:19,751 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-11 11:30:19,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:19,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-01-11 11:30:19,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:19,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 11:30:19,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 11:30:19,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:30:19,772 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-01-11 11:30:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:24,977 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-01-11 11:30:24,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 11:30:24,977 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-01-11 11:30:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:24,978 INFO L225 Difference]: With dead ends: 96 [2019-01-11 11:30:24,978 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 11:30:24,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:30:24,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 11:30:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-11 11:30:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 11:30:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-01-11 11:30:25,010 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-01-11 11:30:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:25,011 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-01-11 11:30:25,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 11:30:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-01-11 11:30:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-11 11:30:25,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:25,011 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-01-11 11:30:25,011 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:25,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-01-11 11:30:25,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:25,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:25,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:26,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:26,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:26,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:26,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:26,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:26,267 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-11 11:30:26,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:30:26,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:30:26,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-11 11:30:26,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:26,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:26,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-01-11 11:30:27,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:27,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-11 11:30:27,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-11 11:30:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-01-11 11:30:27,259 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-01-11 11:30:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:27,806 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-11 11:30:27,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:30:27,806 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-01-11 11:30:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:27,807 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:30:27,807 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:30:27,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-01-11 11:30:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:30:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-11 11:30:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-11 11:30:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-11 11:30:27,839 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-01-11 11:30:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:27,840 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-11 11:30:27,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-11 11:30:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-11 11:30:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-11 11:30:27,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:27,840 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-11 11:30:27,840 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-01-11 11:30:27,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:27,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:27,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:27,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:27,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:30,192 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-11 11:30:30,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:30,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:30,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:30,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:30,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:30,193 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-11 11:30:30,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:30:30,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:30:30,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:30:30,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:30,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:32,807 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-11 11:30:32,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:30:32,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:30:32,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:30:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 11:30:32,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:33,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:30:33,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:30:33,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:30:33,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:30:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 11:30:35,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:35,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-01-11 11:30:35,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:35,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 11:30:35,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 11:30:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:30:35,952 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-01-11 11:30:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:42,302 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-01-11 11:30:42,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-11 11:30:42,303 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-01-11 11:30:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:42,304 INFO L225 Difference]: With dead ends: 101 [2019-01-11 11:30:42,304 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 11:30:42,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 11:30:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 11:30:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-11 11:30:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 11:30:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-11 11:30:42,339 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-11 11:30:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:42,339 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-11 11:30:42,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 11:30:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-11 11:30:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 11:30:42,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:42,340 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-11 11:30:42,340 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-01-11 11:30:42,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:42,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:42,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:45,023 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-11 11:30:45,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:45,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:45,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:45,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:45,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:45,024 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-11 11:30:45,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:45,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:30:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:45,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:47,438 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-11 11:30:47,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:30:47,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:30:47,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:30:47,530 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-11 11:30:47,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:47,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:30:47,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:30:47,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:30:47,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:30:48,543 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-11 11:30:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-01-11 11:30:48,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:48,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 11:30:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 11:30:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 11:30:48,577 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-01-11 11:30:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:53,609 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-11 11:30:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 11:30:53,610 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-01-11 11:30:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:53,611 INFO L225 Difference]: With dead ends: 102 [2019-01-11 11:30:53,611 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:30:53,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:30:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:30:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-11 11:30:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 11:30:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-11 11:30:53,652 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-01-11 11:30:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:53,653 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-11 11:30:53,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 11:30:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-11 11:30:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 11:30:53,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:53,653 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-01-11 11:30:53,653 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-01-11 11:30:53,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:53,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:53,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:30:53,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:53,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:55,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:55,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:55,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:55,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:55,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:55,403 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-11 11:30:55,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:30:55,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:30:55,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-11 11:30:55,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:55,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:30:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:55,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:30:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:30:56,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:30:56,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-01-11 11:30:56,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:30:56,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-11 11:30:56,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-11 11:30:56,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:30:56,438 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-01-11 11:30:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:30:57,037 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-01-11 11:30:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:30:57,038 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-01-11 11:30:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:30:57,038 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:30:57,038 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 11:30:57,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-01-11 11:30:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 11:30:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-11 11:30:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 11:30:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-11 11:30:57,075 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-01-11 11:30:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:30:57,075 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-11 11:30:57,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-11 11:30:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-11 11:30:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 11:30:57,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:30:57,075 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-11 11:30:57,076 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:30:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:30:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-01-11 11:30:57,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:30:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:57,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:30:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:30:57,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:30:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:30:59,851 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-11 11:30:59,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:59,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:30:59,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:30:59,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:30:59,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:30:59,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 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-11 11:30:59,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:30:59,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:30:59,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:30:59,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:30:59,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:02,388 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-11 11:31:02,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:31:02,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:31:02,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:31:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-11 11:31:02,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:02,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:31:02,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:31:02,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:31:02,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:31:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-11 11:31:05,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:05,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-01-11 11:31:05,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:05,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 11:31:05,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 11:31:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:31:05,789 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-01-11 11:31:11,066 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-11 11:31:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:14,085 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-11 11:31:14,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-11 11:31:14,086 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-01-11 11:31:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:14,087 INFO L225 Difference]: With dead ends: 107 [2019-01-11 11:31:14,087 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:31:14,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-01-11 11:31:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:31:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-11 11:31:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:31:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-11 11:31:14,128 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-11 11:31:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:14,128 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-11 11:31:14,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 11:31:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-11 11:31:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 11:31:14,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:14,129 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-11 11:31:14,129 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-01-11 11:31:14,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:14,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:14,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:31:14,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:14,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:16,705 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-11 11:31:16,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:16,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:16,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:16,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:16,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:16,706 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-11 11:31:16,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:16,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:31:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:16,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:19,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:31:19,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:31:19,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:31:19,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:31:19,523 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-11 11:31:19,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:19,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:31:19,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:31:19,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:31:19,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:31:20,850 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-11 11:31:20,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:20,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-01-11 11:31:20,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:20,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 11:31:20,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 11:31:20,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:31:20,881 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-01-11 11:31:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:27,337 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-11 11:31:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 11:31:27,337 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-01-11 11:31:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:27,339 INFO L225 Difference]: With dead ends: 108 [2019-01-11 11:31:27,339 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 11:31:27,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:31:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 11:31:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-11 11:31:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-11 11:31:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-01-11 11:31:27,385 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-01-11 11:31:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:27,385 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-01-11 11:31:27,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 11:31:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-01-11 11:31:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 11:31:27,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:27,386 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-01-11 11:31:27,386 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:27,386 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-01-11 11:31:27,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:27,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:27,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:27,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:27,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:28,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:28,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:28,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:28,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:28,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:28,821 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-11 11:31:28,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:31:28,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:31:29,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 11:31:29,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:31:29,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:29,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:31:30,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:30,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-01-11 11:31:30,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:30,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-11 11:31:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-11 11:31:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-01-11 11:31:30,154 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-01-11 11:31:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:30,807 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-11 11:31:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 11:31:30,808 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-01-11 11:31:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:30,808 INFO L225 Difference]: With dead ends: 75 [2019-01-11 11:31:30,808 INFO L226 Difference]: Without dead ends: 73 [2019-01-11 11:31:30,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:31:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-11 11:31:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-11 11:31:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 11:31:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-11 11:31:30,847 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-01-11 11:31:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:30,847 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-11 11:31:30,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-11 11:31:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-11 11:31:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 11:31:30,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:30,848 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-11 11:31:30,848 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:30,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:30,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-01-11 11:31:30,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:30,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:30,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:31:30,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:30,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:33,647 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-11 11:31:33,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:33,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:33,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:33,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:33,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:33,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 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-11 11:31:33,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:31:33,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:31:33,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:31:33,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:31:33,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:36,818 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-11 11:31:36,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:31:36,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:31:36,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:31:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 11:31:36,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:37,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:31:37,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:31:37,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:31:37,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:31:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 11:31:40,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:40,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-01-11 11:31:40,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:40,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 11:31:40,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 11:31:40,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:31:40,511 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-01-11 11:31:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:31:48,347 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-11 11:31:48,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-11 11:31:48,348 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-01-11 11:31:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:31:48,349 INFO L225 Difference]: With dead ends: 113 [2019-01-11 11:31:48,349 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 11:31:48,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-01-11 11:31:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 11:31:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-11 11:31:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 11:31:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-11 11:31:48,391 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-11 11:31:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:31:48,391 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-11 11:31:48,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 11:31:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-11 11:31:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-11 11:31:48,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:31:48,392 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-11 11:31:48,392 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:31:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:31:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-01-11 11:31:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:31:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:48,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:31:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:31:48,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:31:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:51,276 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-11 11:31:51,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:51,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:31:51,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:31:51,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:31:51,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:31:51,277 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-11 11:31:51,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:31:51,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:31:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:31:51,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:31:54,320 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-11 11:31:54,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:31:54,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:31:54,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:31:54,423 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-11 11:31:54,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:31:54,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:31:54,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:31:54,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:31:54,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:31:55,904 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-11 11:31:55,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:31:55,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-01-11 11:31:55,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:31:55,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 11:31:55,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 11:31:55,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-01-11 11:31:55,925 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-01-11 11:32:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:02,631 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-01-11 11:32:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 11:32:02,632 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-01-11 11:32:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:02,633 INFO L225 Difference]: With dead ends: 114 [2019-01-11 11:32:02,633 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 11:32:02,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:32:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 11:32:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-11 11:32:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 11:32:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-01-11 11:32:02,675 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-01-11 11:32:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:02,675 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-01-11 11:32:02,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 11:32:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-01-11 11:32:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-11 11:32:02,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:02,676 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-01-11 11:32:02,676 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-01-11 11:32:02,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:02,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:32:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:02,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:04,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:04,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:04,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:04,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:04,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:04,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:32:04,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:32:04,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:32:04,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-11 11:32:04,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:32:04,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:04,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:06,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:06,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-01-11 11:32:06,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:06,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-11 11:32:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-11 11:32:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-01-11 11:32:06,243 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-01-11 11:32:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:06,955 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-01-11 11:32:06,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:32:06,955 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-01-11 11:32:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:06,956 INFO L225 Difference]: With dead ends: 79 [2019-01-11 11:32:06,956 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 11:32:06,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-01-11 11:32:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 11:32:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-11 11:32:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:32:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-11 11:32:07,031 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-01-11 11:32:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:07,031 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-11 11:32:07,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-11 11:32:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-11 11:32:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 11:32:07,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:07,032 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-11 11:32:07,032 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-01-11 11:32:07,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:07,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:32:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:07,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:09,711 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-11 11:32:09,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:09,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:09,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:09,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:09,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:09,711 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-11 11:32:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:32:09,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:32:09,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:32:09,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:32:09,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:13,192 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-11 11:32:13,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:32:13,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:32:13,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:32:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-11 11:32:13,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:13,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:32:13,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:32:13,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:32:13,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:32:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-11 11:32:17,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:17,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-01-11 11:32:17,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:17,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-11 11:32:17,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-11 11:32:17,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:32:17,346 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-01-11 11:32:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:27,000 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-01-11 11:32:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-11 11:32:27,001 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-01-11 11:32:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:27,002 INFO L225 Difference]: With dead ends: 119 [2019-01-11 11:32:27,002 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 11:32:27,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-01-11 11:32:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 11:32:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-11 11:32:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 11:32:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-11 11:32:27,063 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-11 11:32:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:27,064 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-11 11:32:27,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-11 11:32:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-11 11:32:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-11 11:32:27,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:27,065 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-11 11:32:27,065 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-01-11 11:32:27,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:27,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:32:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:27,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:30,706 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-11 11:32:30,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:30,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:30,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:30,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:30,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:30,707 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-11 11:32:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:32:30,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:32:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:30,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:34,415 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-11 11:32:34,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:32:34,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:32:34,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:32:34,521 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-11 11:32:34,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:34,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:32:34,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:32:34,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:32:34,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:32:35,771 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-11 11:32:35,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:35,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-01-11 11:32:35,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:35,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-11 11:32:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-11 11:32:35,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:32:35,791 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-01-11 11:32:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:44,228 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-01-11 11:32:44,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 11:32:44,228 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-01-11 11:32:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:44,229 INFO L225 Difference]: With dead ends: 120 [2019-01-11 11:32:44,229 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 11:32:44,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:32:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 11:32:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-11 11:32:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 11:32:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-11 11:32:44,283 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-01-11 11:32:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:44,284 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-11 11:32:44,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-11 11:32:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-11 11:32:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-11 11:32:44,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:44,284 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-01-11 11:32:44,285 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-01-11 11:32:44,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:44,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:44,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:32:44,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:44,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:45,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:45,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:45,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:45,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:45,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:45,042 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-11 11:32:45,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:32:45,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:32:45,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-11 11:32:45,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:32:45,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:45,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:32:46,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:46,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-01-11 11:32:46,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:46,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-11 11:32:46,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-11 11:32:46,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:32:46,613 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-01-11 11:32:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:32:47,643 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-01-11 11:32:47,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 11:32:47,643 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-01-11 11:32:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:32:47,644 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:32:47,644 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 11:32:47,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-01-11 11:32:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 11:32:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-11 11:32:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 11:32:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-11 11:32:47,696 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-01-11 11:32:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:32:47,697 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-11 11:32:47,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-11 11:32:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-11 11:32:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 11:32:47,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:32:47,698 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-11 11:32:47,698 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:32:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:32:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-01-11 11:32:47,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:32:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:47,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:32:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:32:47,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:32:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:32:50,660 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-11 11:32:50,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:50,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:32:50,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:32:50,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:32:50,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:32:50,660 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-11 11:32:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:32:50,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:32:50,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:32:50,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:32:50,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:32:55,367 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-11 11:32:55,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:32:55,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:32:55,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:32:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-11 11:32:55,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:32:55,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:32:55,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:32:55,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:32:55,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:32:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-11 11:32:59,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:32:59,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-01-11 11:32:59,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:32:59,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-11 11:32:59,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-11 11:32:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:32:59,925 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-01-11 11:33:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:09,991 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-11 11:33:09,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-01-11 11:33:09,991 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-01-11 11:33:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:09,992 INFO L225 Difference]: With dead ends: 125 [2019-01-11 11:33:09,992 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:33:09,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-01-11 11:33:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:33:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-11 11:33:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 11:33:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-11 11:33:10,056 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-11 11:33:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:10,056 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-11 11:33:10,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-11 11:33:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-11 11:33:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 11:33:10,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:10,057 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-11 11:33:10,057 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-01-11 11:33:10,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:10,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:33:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:10,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:13,487 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-11 11:33:13,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:13,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:13,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:13,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:13,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:13,487 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-11 11:33:13,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:33:13,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:33:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:13,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:33:17,078 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-11 11:33:17,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:33:17,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:33:17,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:33:17,194 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-11 11:33:17,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:17,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:33:17,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:33:17,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:33:17,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:33:18,730 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-11 11:33:18,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:18,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-01-11 11:33:18,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:18,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-11 11:33:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-11 11:33:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-01-11 11:33:18,750 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-01-11 11:33:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:27,494 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-01-11 11:33:27,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 11:33:27,494 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-01-11 11:33:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:27,495 INFO L225 Difference]: With dead ends: 126 [2019-01-11 11:33:27,495 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 11:33:27,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:33:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 11:33:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-11 11:33:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:33:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-11 11:33:27,546 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-01-11 11:33:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:27,546 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-11 11:33:27,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-11 11:33:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-11 11:33:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 11:33:27,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:27,547 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-01-11 11:33:27,547 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-01-11 11:33:27,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:27,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:33:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:27,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:28,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:28,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:28,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:28,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:28,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:28,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:33:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:33:28,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:33:28,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-11 11:33:28,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:33:28,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:33:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:28,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:33:30,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:30,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-01-11 11:33:30,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:30,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-11 11:33:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-11 11:33:30,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-01-11 11:33:30,054 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-01-11 11:33:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:30,903 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-11 11:33:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 11:33:30,903 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-01-11 11:33:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:30,904 INFO L225 Difference]: With dead ends: 87 [2019-01-11 11:33:30,904 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 11:33:30,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-01-11 11:33:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 11:33:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-11 11:33:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 11:33:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-11 11:33:30,956 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-01-11 11:33:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:30,956 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-11 11:33:30,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-11 11:33:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-11 11:33:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 11:33:30,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:30,957 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-11 11:33:30,957 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:30,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-01-11 11:33:30,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:30,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:30,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:33:30,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:30,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:34,362 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-11 11:33:34,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:34,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:34,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:34,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:34,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:34,363 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-11 11:33:34,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:33:34,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:33:34,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:33:34,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:33:34,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:33:38,502 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-11 11:33:38,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:33:38,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:33:38,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:33:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-11 11:33:38,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:33:38,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:33:38,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:33:38,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:33:38,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:33:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-11 11:33:43,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:33:43,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-01-11 11:33:43,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:33:43,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-11 11:33:43,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-11 11:33:43,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:33:43,417 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-01-11 11:33:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:33:54,468 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-01-11 11:33:54,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-01-11 11:33:54,469 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-01-11 11:33:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:33:54,469 INFO L225 Difference]: With dead ends: 131 [2019-01-11 11:33:54,469 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 11:33:54,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-01-11 11:33:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 11:33:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-11 11:33:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 11:33:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-11 11:33:54,536 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-11 11:33:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:33:54,537 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-11 11:33:54,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-11 11:33:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-11 11:33:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 11:33:54,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:33:54,537 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-11 11:33:54,537 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:33:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:33:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-01-11 11:33:54,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:33:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:54,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:33:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:33:54,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:33:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:57,889 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-11 11:33:57,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:57,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:33:57,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:33:57,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:33:57,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:33:57,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:33:57,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:33:57,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:33:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:33:57,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:02,126 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-11 11:34:02,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:34:02,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:34:02,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:34:02,245 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-11 11:34:02,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:34:02,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:34:02,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:34:02,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:34:02,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:34:04,066 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-11 11:34:04,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:34:04,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-01-11 11:34:04,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:34:04,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-11 11:34:04,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-11 11:34:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:34:04,099 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-01-11 11:34:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:34:13,520 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-01-11 11:34:13,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 11:34:13,520 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-01-11 11:34:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:34:13,521 INFO L225 Difference]: With dead ends: 132 [2019-01-11 11:34:13,521 INFO L226 Difference]: Without dead ends: 88 [2019-01-11 11:34:13,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:34:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-11 11:34:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-11 11:34:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-11 11:34:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-01-11 11:34:13,610 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-01-11 11:34:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:34:13,610 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-01-11 11:34:13,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-11 11:34:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-01-11 11:34:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-11 11:34:13,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:34:13,611 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-01-11 11:34:13,611 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:34:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:34:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-01-11 11:34:13,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:34:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:13,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:34:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:13,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:34:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:14,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:14,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:34:14,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:34:14,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:34:14,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:14,703 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-11 11:34:14,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:34:14,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:34:15,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-11 11:34:15,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:34:15,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:15,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:34:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:34:16,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:34:16,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-01-11 11:34:16,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:34:16,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-11 11:34:16,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-11 11:34:16,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-01-11 11:34:16,426 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-01-11 11:34:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:34:17,337 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-01-11 11:34:17,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 11:34:17,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-01-11 11:34:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:34:17,338 INFO L225 Difference]: With dead ends: 91 [2019-01-11 11:34:17,338 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:34:17,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-01-11 11:34:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:34:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-11 11:34:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-11 11:34:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-11 11:34:17,396 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-01-11 11:34:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:34:17,396 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-11 11:34:17,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-11 11:34:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-11 11:34:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-11 11:34:17,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:34:17,397 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-11 11:34:17,397 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:34:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:34:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-01-11 11:34:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:34:17,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:17,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:34:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:17,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:34:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:21,188 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-11 11:34:21,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:21,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:34:21,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:34:21,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:34:21,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:21,189 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-11 11:34:21,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:34:21,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:34:21,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:34:21,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:34:21,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:25,819 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-11 11:34:25,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:34:25,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:34:25,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:34:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-11 11:34:25,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:34:26,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:34:26,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:34:26,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:34:26,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:34:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-11 11:34:31,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:34:31,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-01-11 11:34:31,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:34:31,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-11 11:34:31,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-11 11:34:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:34:31,218 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-01-11 11:34:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:34:43,470 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-01-11 11:34:43,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-01-11 11:34:43,471 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-01-11 11:34:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:34:43,471 INFO L225 Difference]: With dead ends: 137 [2019-01-11 11:34:43,471 INFO L226 Difference]: Without dead ends: 91 [2019-01-11 11:34:43,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2019-01-11 11:34:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-11 11:34:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-11 11:34:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:34:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-11 11:34:43,530 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-11 11:34:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:34:43,530 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-11 11:34:43,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-11 11:34:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-11 11:34:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 11:34:43,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:34:43,531 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-11 11:34:43,531 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:34:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:34:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-01-11 11:34:43,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:34:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:43,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:34:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:34:43,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:34:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:47,479 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-11 11:34:47,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:47,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:34:47,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:34:47,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:34:47,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:34:47,480 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-11 11:34:47,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:34:47,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:34:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:34:47,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:34:52,013 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-11 11:34:52,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:34:52,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:34:52,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:34:52,142 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-11 11:34:52,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:34:52,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:34:52,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:34:52,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:34:52,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:34:53,872 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-11 11:34:53,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:34:53,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-01-11 11:34:53,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:34:53,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-11 11:34:53,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-11 11:34:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-01-11 11:34:53,894 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-01-11 11:35:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:04,450 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-01-11 11:35:04,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-11 11:35:04,450 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-01-11 11:35:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:04,451 INFO L225 Difference]: With dead ends: 138 [2019-01-11 11:35:04,451 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 11:35:04,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:35:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 11:35:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-11 11:35:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-11 11:35:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-01-11 11:35:04,512 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-01-11 11:35:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:04,512 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-01-11 11:35:04,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-11 11:35:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-01-11 11:35:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-11 11:35:04,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:04,512 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-01-11 11:35:04,513 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-01-11 11:35:04,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:04,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:35:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:04,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:05,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:05,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:35:05,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:35:05,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:35:05,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:05,695 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-11 11:35:05,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:35:05,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:35:06,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-11 11:35:06,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:35:06,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:35:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:06,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:35:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:07,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:35:07,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-01-11 11:35:07,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:35:07,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:35:07,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:35:07,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:35:07,522 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-01-11 11:35:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:08,502 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-01-11 11:35:08,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 11:35:08,502 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-01-11 11:35:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:08,503 INFO L225 Difference]: With dead ends: 95 [2019-01-11 11:35:08,503 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 11:35:08,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-01-11 11:35:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 11:35:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-11 11:35:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 11:35:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-11 11:35:08,569 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-01-11 11:35:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:08,570 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-11 11:35:08,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:35:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-11 11:35:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-11 11:35:08,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:08,570 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-11 11:35:08,570 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-01-11 11:35:08,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:08,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:08,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:35:08,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:08,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:12,697 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-11 11:35:12,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:12,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:35:12,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:35:12,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:35:12,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:12,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 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-11 11:35:12,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:35:12,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:35:12,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:35:12,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:35:12,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:35:17,514 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-11 11:35:17,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:35:17,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:35:17,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:35:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-11 11:35:17,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:35:17,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:35:17,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:35:17,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:35:17,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:35:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-11 11:35:23,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:35:23,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-01-11 11:35:23,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:35:23,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-11 11:35:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-11 11:35:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:35:23,237 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-01-11 11:35:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:36,185 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-01-11 11:35:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-01-11 11:35:36,186 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-01-11 11:35:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:36,186 INFO L225 Difference]: With dead ends: 143 [2019-01-11 11:35:36,187 INFO L226 Difference]: Without dead ends: 95 [2019-01-11 11:35:36,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-01-11 11:35:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-11 11:35:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-11 11:35:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 11:35:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-11 11:35:36,251 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-11 11:35:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:36,251 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-11 11:35:36,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-11 11:35:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-11 11:35:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-11 11:35:36,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:36,252 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-11 11:35:36,252 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-01-11 11:35:36,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:36,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:36,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:35:36,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:36,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:40,295 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-11 11:35:40,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:40,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:35:40,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:35:40,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:35:40,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:40,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:35:40,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:35:40,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:35:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:40,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:35:45,223 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-11 11:35:45,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:35:45,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:35:45,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:35:45,361 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-11 11:35:45,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:35:45,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:35:45,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:35:45,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:35:45,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:35:47,650 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-11 11:35:47,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:35:47,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-01-11 11:35:47,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:35:47,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-11 11:35:47,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-11 11:35:47,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:35:47,671 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-01-11 11:35:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:35:58,724 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-01-11 11:35:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-11 11:35:58,725 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-01-11 11:35:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:35:58,726 INFO L225 Difference]: With dead ends: 144 [2019-01-11 11:35:58,726 INFO L226 Difference]: Without dead ends: 96 [2019-01-11 11:35:58,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:35:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-11 11:35:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-11 11:35:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 11:35:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-01-11 11:35:58,806 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-01-11 11:35:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:35:58,806 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-01-11 11:35:58,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-11 11:35:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-01-11 11:35:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 11:35:58,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:35:58,807 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-01-11 11:35:58,807 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:35:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:35:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-01-11 11:35:58,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:35:58,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:58,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:35:58,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:35:58,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:35:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:35:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:35:59,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:59,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:35:59,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:35:59,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:35:59,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:35:59,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:35:59,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:35:59,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:36:00,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 11:36:00,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:36:00,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:36:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:00,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:36:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:02,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:36:02,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-01-11 11:36:02,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:36:02,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-11 11:36:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-11 11:36:02,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-01-11 11:36:02,050 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-01-11 11:36:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:36:03,119 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-01-11 11:36:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-11 11:36:03,119 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-01-11 11:36:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:36:03,120 INFO L225 Difference]: With dead ends: 99 [2019-01-11 11:36:03,120 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 11:36:03,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:36:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 11:36:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-11 11:36:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 11:36:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-11 11:36:03,189 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-01-11 11:36:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:36:03,189 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-11 11:36:03,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-11 11:36:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-11 11:36:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 11:36:03,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:36:03,190 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-11 11:36:03,190 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:36:03,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:36:03,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-01-11 11:36:03,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:36:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:03,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:36:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:03,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:36:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:07,521 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-11 11:36:07,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:07,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:36:07,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:36:07,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:36:07,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:07,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:36:07,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:36:07,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:36:07,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:36:07,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:36:07,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:36:12,770 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-11 11:36:12,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:36:12,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:36:12,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:36:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-11 11:36:12,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:36:13,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:36:13,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:36:13,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:36:13,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:36:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-11 11:36:18,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:36:18,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-01-11 11:36:18,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:36:18,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-01-11 11:36:18,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-01-11 11:36:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:36:18,954 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-01-11 11:36:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:36:33,592 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-01-11 11:36:33,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-01-11 11:36:33,592 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-01-11 11:36:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:36:33,593 INFO L225 Difference]: With dead ends: 149 [2019-01-11 11:36:33,593 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 11:36:33,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-01-11 11:36:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 11:36:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-11 11:36:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-11 11:36:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-11 11:36:33,666 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-11 11:36:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:36:33,666 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-11 11:36:33,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-01-11 11:36:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-11 11:36:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 11:36:33,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:36:33,667 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-11 11:36:33,667 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:36:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:36:33,667 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-01-11 11:36:33,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:36:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:33,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:36:33,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:33,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:36:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:38,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-11 11:36:38,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:38,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:36:38,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:36:38,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:36:38,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:38,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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:36:38,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:36:38,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:36:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:38,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:36:43,619 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-11 11:36:43,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:36:43,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:36:43,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:36:43,757 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-11 11:36:43,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:36:43,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:36:43,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:36:43,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:36:43,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:36:45,823 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-11 11:36:45,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:36:45,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-01-11 11:36:45,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:36:45,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-11 11:36:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-11 11:36:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-01-11 11:36:45,844 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-01-11 11:36:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:36:57,000 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-01-11 11:36:57,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-11 11:36:57,001 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-01-11 11:36:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:36:57,001 INFO L225 Difference]: With dead ends: 150 [2019-01-11 11:36:57,002 INFO L226 Difference]: Without dead ends: 100 [2019-01-11 11:36:57,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:36:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-11 11:36:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-11 11:36:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 11:36:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-11 11:36:57,076 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-01-11 11:36:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:36:57,076 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-11 11:36:57,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-11 11:36:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-11 11:36:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 11:36:57,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:36:57,077 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-01-11 11:36:57,077 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:36:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:36:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-01-11 11:36:57,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:36:57,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:57,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:36:57,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:36:57,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:36:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:36:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:58,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:58,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:36:58,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:36:58,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:36:58,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:36:58,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:36:58,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:36:58,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:36:58,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-11 11:36:58,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:36:58,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:36:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:36:58,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:37:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:37:00,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:37:00,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-01-11 11:37:00,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:37:00,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-11 11:37:00,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-11 11:37:00,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-01-11 11:37:00,431 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-01-11 11:37:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:37:01,537 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-01-11 11:37:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-11 11:37:01,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-11 11:37:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:37:01,538 INFO L225 Difference]: With dead ends: 103 [2019-01-11 11:37:01,538 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 11:37:01,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-01-11 11:37:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 11:37:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-11 11:37:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:37:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-11 11:37:01,613 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-01-11 11:37:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:37:01,613 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-11 11:37:01,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-11 11:37:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-11 11:37:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 11:37:01,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:37:01,613 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-11 11:37:01,614 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:37:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:37:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-01-11 11:37:01,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:37:01,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:01,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:37:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:01,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:37:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:37:06,305 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-11 11:37:06,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:06,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:37:06,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:37:06,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:37:06,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:06,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:37:06,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:37:06,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:37:06,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:37:06,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:37:06,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:37:12,009 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-11 11:37:12,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:37:12,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:37:12,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:37:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-11 11:37:12,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:37:12,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:37:12,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:37:12,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:37:12,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:37:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-11 11:37:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:37:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-01-11 11:37:19,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:37:19,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-01-11 11:37:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-01-11 11:37:19,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:37:19,127 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-01-11 11:37:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:37:34,711 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-01-11 11:37:34,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-01-11 11:37:34,712 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-01-11 11:37:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:37:34,713 INFO L225 Difference]: With dead ends: 155 [2019-01-11 11:37:34,713 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 11:37:34,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-01-11 11:37:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 11:37:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-11 11:37:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 11:37:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-11 11:37:34,788 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-11 11:37:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:37:34,788 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-11 11:37:34,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-01-11 11:37:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-11 11:37:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 11:37:34,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:37:34,788 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-11 11:37:34,789 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:37:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:37:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-01-11 11:37:34,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:37:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:34,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:37:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:37:34,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:37:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:37:39,764 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-11 11:37:39,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:39,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:37:39,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:37:39,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:37:39,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:37:39,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:37:39,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:37:39,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:37:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:37:39,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:37:45,681 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-11 11:37:45,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:37:45,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:37:45,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:37:45,826 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-11 11:37:45,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:37:45,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:37:45,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:37:45,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:37:45,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:37:48,144 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-11 11:37:48,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:37:48,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-01-11 11:37:48,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:37:48,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-11 11:37:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-11 11:37:48,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:37:48,164 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-01-11 11:38:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:38:00,392 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-01-11 11:38:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-11 11:38:00,392 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-01-11 11:38:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:38:00,393 INFO L225 Difference]: With dead ends: 156 [2019-01-11 11:38:00,393 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 11:38:00,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:38:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 11:38:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-11 11:38:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-11 11:38:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-11 11:38:00,469 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-01-11 11:38:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:38:00,469 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-11 11:38:00,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-11 11:38:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-11 11:38:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 11:38:00,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:38:00,470 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-01-11 11:38:00,470 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:38:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:38:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-01-11 11:38:00,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:38:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:38:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:00,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:38:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:38:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:01,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:01,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:38:01,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:38:01,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:38:01,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:01,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:38:01,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:38:01,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:38:01,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-11 11:38:01,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:38:02,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:38:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:02,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:38:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:38:03,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:38:03,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-01-11 11:38:03,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:38:03,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 11:38:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 11:38:03,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:38:03,818 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-01-11 11:38:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:38:05,306 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-01-11 11:38:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-11 11:38:05,306 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-01-11 11:38:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:38:05,307 INFO L225 Difference]: With dead ends: 107 [2019-01-11 11:38:05,307 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 11:38:05,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-01-11 11:38:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 11:38:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-11 11:38:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 11:38:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-11 11:38:05,389 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-01-11 11:38:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:38:05,389 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-11 11:38:05,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 11:38:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-11 11:38:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 11:38:05,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:38:05,389 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-11 11:38:05,390 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:38:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:38:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-01-11 11:38:05,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:38:05,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:05,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:38:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:05,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:38:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:38:10,513 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-11 11:38:10,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:10,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:38:10,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:38:10,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:38:10,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:10,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:38:10,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:38:10,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:38:10,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:38:10,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:38:10,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:38:16,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:38:16,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:38:16,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:38:16,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:38:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-11 11:38:16,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:38:16,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:38:16,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:38:16,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:38:16,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:38:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-11 11:38:23,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:38:23,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-01-11 11:38:23,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:38:23,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-11 11:38:23,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-11 11:38:23,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:38:23,954 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-01-11 11:38:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:38:39,651 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-11 11:38:39,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-01-11 11:38:39,652 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-01-11 11:38:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:38:39,653 INFO L225 Difference]: With dead ends: 161 [2019-01-11 11:38:39,653 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 11:38:39,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2019-01-11 11:38:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 11:38:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-11 11:38:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 11:38:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-11 11:38:39,736 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-11 11:38:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:38:39,736 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-11 11:38:39,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-11 11:38:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-11 11:38:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 11:38:39,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:38:39,737 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-11 11:38:39,737 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:38:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:38:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-01-11 11:38:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:38:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:39,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:38:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:38:39,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:38:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:38:44,810 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-11 11:38:44,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:44,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:38:44,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:38:44,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:38:44,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:38:44,811 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:38:44,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:38:44,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:38:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:38:44,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:38:51,035 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-11 11:38:51,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:38:51,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:38:51,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:38:51,185 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-11 11:38:51,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:38:51,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:38:51,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:38:51,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:38:51,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:38:53,679 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-11 11:38:53,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:38:53,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2019-01-11 11:38:53,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:38:53,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-11 11:38:53,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-11 11:38:53,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:38:53,699 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2019-01-11 11:39:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:39:05,954 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-01-11 11:39:05,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-11 11:39:05,954 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2019-01-11 11:39:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:39:05,955 INFO L225 Difference]: With dead ends: 162 [2019-01-11 11:39:05,955 INFO L226 Difference]: Without dead ends: 108 [2019-01-11 11:39:05,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 11:39:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-11 11:39:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-11 11:39:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 11:39:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-01-11 11:39:06,041 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-01-11 11:39:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:39:06,041 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-01-11 11:39:06,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-11 11:39:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-01-11 11:39:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-11 11:39:06,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:39:06,042 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2019-01-11 11:39:06,042 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:39:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:39:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2019-01-11 11:39:06,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:39:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:06,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:39:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:06,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:39:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:39:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:07,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:07,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:39:07,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:39:07,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:39:07,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:07,154 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:39:07,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:39:07,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:39:07,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 11:39:07,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:39:07,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:39:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:07,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:39:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:39:09,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:39:09,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-01-11 11:39:09,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:39:09,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-11 11:39:09,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-11 11:39:09,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-01-11 11:39:09,665 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2019-01-11 11:39:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:39:11,179 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-01-11 11:39:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-11 11:39:11,179 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-01-11 11:39:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:39:11,180 INFO L225 Difference]: With dead ends: 111 [2019-01-11 11:39:11,180 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 11:39:11,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:39:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 11:39:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-11 11:39:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-11 11:39:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-11 11:39:11,263 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-01-11 11:39:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:39:11,263 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-11 11:39:11,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-11 11:39:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-11 11:39:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-11 11:39:11,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:39:11,264 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-11 11:39:11,264 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:39:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:39:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2019-01-11 11:39:11,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:39:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:11,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:39:11,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:11,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:39:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:39:16,548 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-11 11:39:16,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:16,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:39:16,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:39:16,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:39:16,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:16,549 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:39:16,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:39:16,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:39:16,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:39:16,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:39:16,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:39:23,240 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-11 11:39:23,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:39:23,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:39:23,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:39:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-11 11:39:23,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:39:23,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:39:23,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:39:23,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:39:23,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:39:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-11 11:39:31,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:39:31,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2019-01-11 11:39:31,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:39:31,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-01-11 11:39:31,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-01-11 11:39:31,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 11:39:31,217 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2019-01-11 11:39:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:39:48,547 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-01-11 11:39:48,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-01-11 11:39:48,547 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2019-01-11 11:39:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:39:48,548 INFO L225 Difference]: With dead ends: 167 [2019-01-11 11:39:48,548 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 11:39:48,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2019-01-11 11:39:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 11:39:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-11 11:39:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 11:39:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-11 11:39:48,640 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-11 11:39:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:39:48,640 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-11 11:39:48,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-01-11 11:39:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-11 11:39:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 11:39:48,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:39:48,641 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-11 11:39:48,641 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:39:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:39:48,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2019-01-11 11:39:48,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:39:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:48,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:39:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:39:48,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:39:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:39:54,070 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-11 11:39:54,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:54,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:39:54,070 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:39:54,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:39:54,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:39:54,071 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:39:54,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:39:54,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:39:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:39:54,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:40:00,761 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-11 11:40:00,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:40:00,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:40:00,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:40:00,913 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-11 11:40:00,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:40:00,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-11 11:40:00,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:40:00,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:40:00,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:40:03,927 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-11 11:40:03,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:40:03,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2019-01-11 11:40:03,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:40:03,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-11 11:40:03,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-11 11:40:03,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:40:03,948 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states.