java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:00:50,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:00:50,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:00:50,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:00:50,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:00:50,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:00:50,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:00:50,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:00:50,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:00:50,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:00:50,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:00:50,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:00:50,294 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:00:50,295 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:00:50,296 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:00:50,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:00:50,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:00:50,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:00:50,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:00:50,303 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:00:50,304 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:00:50,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:00:50,313 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:00:50,313 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:00:50,313 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:00:50,314 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:00:50,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:00:50,316 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:00:50,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:00:50,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:00:50,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:00:50,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:00:50,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:00:50,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:00:50,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:00:50,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:00:50,328 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:00:50,353 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:00:50,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:00:50,354 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:00:50,355 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:00:50,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:00:50,355 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:00:50,355 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:00:50,355 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:00:50,356 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:00:50,357 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:00:50,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:00:50,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:00:50,358 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:00:50,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:00:50,361 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:00:50,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:00:50,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:00:50,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:00:50,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:00:50,362 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:00:50,362 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:00:50,363 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:00:50,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:00:50,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:00:50,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:00:50,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:00:50,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:00:50,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:00:50,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:00:50,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:00:50,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:00:50,365 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:00:50,365 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:00:50,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:00:50,366 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:00:50,366 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:00:50,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:00:50,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:00:50,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:00:50,445 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:00:50,446 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:00:50,446 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:00:50,447 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:00:50,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:00:50,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:00:50,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:00:50,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:00:50,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:00:50,519 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:00:50" (1/1) ... [2019-01-11 11:00:50,531 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:00:50" (1/1) ... [2019-01-11 11:00:50,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:00:50,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:00:50,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:00:50,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:00:50,554 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:00:50" (1/1) ... [2019-01-11 11:00:50,555 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:00:50" (1/1) ... [2019-01-11 11:00:50,556 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:00:50" (1/1) ... [2019-01-11 11:00:50,556 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:00:50" (1/1) ... [2019-01-11 11:00:50,563 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:00:50" (1/1) ... [2019-01-11 11:00:50,565 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:00:50" (1/1) ... [2019-01-11 11:00:50,566 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:00:50" (1/1) ... [2019-01-11 11:00:50,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:00:50,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:00:50,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:00:50,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:00:50,570 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:00:50" (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:00:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:00:50,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:00:50,847 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:00:50,847 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-11 11:00:50,848 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:00:50 BoogieIcfgContainer [2019-01-11 11:00:50,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:00:50,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:00:50,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:00:50,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:00:50,853 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:00:50" (1/2) ... [2019-01-11 11:00:50,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ea76e6 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:00:50, skipping insertion in model container [2019-01-11 11:00:50,854 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:00:50" (2/2) ... [2019-01-11 11:00:50,858 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-01-11 11:00:50,869 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:00:50,877 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 11:00:50,895 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 11:00:50,930 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:00:50,931 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:00:50,931 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:00:50,931 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:00:50,931 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:00:50,931 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:00:50,932 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:00:50,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:00:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-11 11:00:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:00:50,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:50,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:00:50,967 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:50,975 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-11 11:00:50,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:51,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:51,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:51,137 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:00:51,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:00:51,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:00:51,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:00:51,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:00:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:00:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:00:51,187 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-11 11:00:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:51,283 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-11 11:00:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:00:51,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 11:00:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:51,301 INFO L225 Difference]: With dead ends: 10 [2019-01-11 11:00:51,301 INFO L226 Difference]: Without dead ends: 6 [2019-01-11 11:00:51,308 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:00:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-11 11:00:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-11 11:00:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 11:00:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-11 11:00:51,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-01-11 11:00:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:51,343 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-11 11:00:51,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:00:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-11 11:00:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:00:51,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:51,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:00:51,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:51,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:51,345 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-01-11 11:00:51,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:51,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:51,439 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:00:51,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:00:51,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:00:51,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:00:51,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:00:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:00:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:00:51,443 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-11 11:00:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:51,498 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-11 11:00:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:00:51,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:00:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:51,500 INFO L225 Difference]: With dead ends: 11 [2019-01-11 11:00:51,500 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 11:00:51,501 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:00:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 11:00:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 11:00:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 11:00:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-11 11:00:51,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-11 11:00:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:51,504 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-11 11:00:51,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:00:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-11 11:00:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:00:51,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:51,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:00:51,506 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-11 11:00:51,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:51,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:51,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:51,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:51,807 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:00:51,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:51,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:51,808 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:00:51,810 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-11 11:00:51,854 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:00:51,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:00:51,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:00:51,994 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 5 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:00:51,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:52,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:00:52,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:52,001 INFO 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:00:52,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:52,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:00:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:52,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:52,458 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:00:52,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:52,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:52,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:00:52,528 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:00:52,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:52,568 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:00:52,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:52,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:52,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:00:52,693 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:00:52,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:52,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-11 11:00:52,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:52,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:00:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:00:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:00:52,713 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-01-11 11:00:52,863 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-11 11:00:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:53,141 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-11 11:00:53,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:00:53,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:00:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:53,142 INFO L225 Difference]: With dead ends: 12 [2019-01-11 11:00:53,143 INFO L226 Difference]: Without dead ends: 8 [2019-01-11 11:00:53,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:00:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-11 11:00:53,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-11 11:00:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 11:00:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-11 11:00:53,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-01-11 11:00:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:53,148 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-11 11:00:53,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:00:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-11 11:00:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:00:53,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:53,149 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:00:53,150 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:53,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:53,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-01-11 11:00:53,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:53,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:53,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:53,303 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:00:53,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:53,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:53,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:53,304 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:00:53,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:53,304 INFO 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:00:53,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:00:53,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:00:53,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:00:53,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:53,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:53,350 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:00:53,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:53,372 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:00:53,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:53,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-01-11 11:00:53,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:53,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:00:53,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:00:53,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:00:53,393 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-01-11 11:00:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:53,708 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-11 11:00:53,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:00:53,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-11 11:00:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:53,711 INFO L225 Difference]: With dead ends: 11 [2019-01-11 11:00:53,711 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 11:00:53,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:00:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 11:00:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 11:00:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 11:00:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-11 11:00:53,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-01-11 11:00:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:53,716 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-11 11:00:53,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:00:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-11 11:00:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:00:53,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:53,716 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-11 11:00:53,717 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-01-11 11:00:53,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:53,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:53,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:53,874 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:00:53,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:53,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:53,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:53,875 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:00:53,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:53,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:00:53,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:00:53,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:00:53,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:00:53,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:53,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:54,016 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:00:54,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:54,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:54,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:00:54,057 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:00:54,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:54,236 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-11 11:00:54,241 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:00:54,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:54,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:54,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:00:54,405 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:00:54,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:54,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-01-11 11:00:54,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:54,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:00:54,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:00:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:00:54,426 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-01-11 11:00:54,788 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-11 11:00:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:55,013 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-11 11:00:55,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:00:55,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:00:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:55,015 INFO L225 Difference]: With dead ends: 17 [2019-01-11 11:00:55,015 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 11:00:55,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:00:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 11:00:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 11:00:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:00:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-11 11:00:55,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-11 11:00:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:55,021 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-11 11:00:55,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:00:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-11 11:00:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:00:55,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:55,022 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-11 11:00:55,023 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:55,023 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-01-11 11:00:55,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:55,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:55,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:55,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:55,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:55,207 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:00:55,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:55,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:55,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:55,208 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:00:55,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:55,209 INFO 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:00:55,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:55,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:00:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:55,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:55,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:00:55,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:55,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:55,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:00:55,415 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:00:55,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:55,440 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:00:55,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:55,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:55,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:00:55,606 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:00:55,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:55,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-01-11 11:00:55,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:55,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 11:00:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 11:00:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:00:55,627 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-01-11 11:00:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:56,008 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-11 11:00:56,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:00:56,008 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-01-11 11:00:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:56,010 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:00:56,010 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 11:00:56,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:00:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 11:00:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 11:00:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:00:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-11 11:00:56,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-01-11 11:00:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:56,015 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-11 11:00:56,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 11:00:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-11 11:00:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 11:00:56,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:56,015 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-01-11 11:00:56,016 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:56,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-01-11 11:00:56,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:56,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:56,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:56,094 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:00:56,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:56,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:56,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:56,094 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:00:56,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:56,095 INFO 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:00:56,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:00:56,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:00:56,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:00:56,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:56,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:56,135 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:00:56,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:56,216 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:00:56,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:56,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-11 11:00:56,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:56,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:00:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:00:56,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:00:56,238 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-01-11 11:00:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:56,343 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-11 11:00:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:00:56,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-11 11:00:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:56,345 INFO L225 Difference]: With dead ends: 15 [2019-01-11 11:00:56,345 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 11:00:56,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:00:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 11:00:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-11 11:00:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 11:00:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-11 11:00:56,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-01-11 11:00:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:56,351 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-11 11:00:56,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:00:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-11 11:00:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 11:00:56,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:56,352 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-11 11:00:56,352 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:56,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:56,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-01-11 11:00:56,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:56,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:56,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:56,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:56,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:56,555 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:00:56,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:56,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:56,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:56,557 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:00:56,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:56,557 INFO 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:00:56,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:00:56,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:00:56,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:00:56,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:56,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:56,695 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:00:56,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:56,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:56,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:00:56,724 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:00:56,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:56,774 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:00:56,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:56,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:56,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:00:56,978 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:00:56,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:56,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-01-11 11:00:56,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:56,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 11:00:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 11:00:56,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:00:56,999 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-01-11 11:00:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:57,787 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-11 11:00:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:00:57,787 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-01-11 11:00:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:57,788 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:00:57,788 INFO L226 Difference]: Without dead ends: 15 [2019-01-11 11:00:57,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-01-11 11:00:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-11 11:00:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-11 11:00:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 11:00:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-11 11:00:57,795 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-11 11:00:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:57,795 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-11 11:00:57,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 11:00:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-11 11:00:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 11:00:57,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:57,796 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-11 11:00:57,797 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:57,797 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-01-11 11:00:57,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:57,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:57,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:58,099 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:00:58,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:58,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:58,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:58,100 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:00:58,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:58,100 INFO 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:00:58,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:58,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:00:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:58,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:58,264 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:00:58,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:58,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:58,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:00:58,292 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:00:58,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:58,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:00:58,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:00:58,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:00:58,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:00:58,338 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:00:58,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:58,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-01-11 11:00:58,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:58,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 11:00:58,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 11:00:58,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:00:58,358 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-01-11 11:00:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:59,172 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-11 11:00:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 11:00:59,173 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-01-11 11:00:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:59,174 INFO L225 Difference]: With dead ends: 24 [2019-01-11 11:00:59,174 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 11:00:59,175 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:00:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 11:00:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-11 11:00:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:00:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-11 11:00:59,181 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-01-11 11:00:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-11 11:00:59,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 11:00:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-11 11:00:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 11:00:59,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:59,182 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-01-11 11:00:59,182 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-01-11 11:00:59,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:59,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:00:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:59,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:59,267 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:00:59,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:59,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:59,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:59,269 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:00:59,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:59,269 INFO 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:00:59,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:00:59,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:00:59,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:00:59,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:00:59,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:00:59,351 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:00:59,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:00:59,568 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:00:59,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:00:59,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-01-11 11:00:59,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:00:59,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:00:59,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:00:59,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:00:59,589 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-01-11 11:00:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:00:59,695 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-11 11:00:59,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:00:59,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-11 11:00:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:00:59,698 INFO L225 Difference]: With dead ends: 19 [2019-01-11 11:00:59,698 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:00:59,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:00:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:00:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 11:00:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:00:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-11 11:00:59,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-11 11:00:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:00:59,705 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-11 11:00:59,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:00:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-11 11:00:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 11:00:59,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:00:59,706 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-11 11:00:59,706 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:00:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:00:59,706 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-01-11 11:00:59,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:00:59,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:59,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:00:59,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:00:59,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:00:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:00:59,969 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:00:59,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:59,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:00:59,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:00:59,970 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:00:59,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:00:59,970 INFO 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:00:59,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:00:59,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:00,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:00,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:00,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:00,213 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:01:00,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:00,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:00,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:01:00,252 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:01:00,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:00,299 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:01:00,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:00,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:00,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:01:00,490 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:01:00,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:00,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-01-11 11:01:00,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:00,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 11:01:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 11:01:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:01:00,519 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-01-11 11:01:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:01,389 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-01-11 11:01:01,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:01:01,389 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-01-11 11:01:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:01,390 INFO L225 Difference]: With dead ends: 29 [2019-01-11 11:01:01,391 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 11:01:01,392 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:01:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 11:01:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-11 11:01:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 11:01:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-11 11:01:01,398 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-11 11:01:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:01,399 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-11 11:01:01,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 11:01:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-11 11:01:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 11:01:01,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:01,399 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-11 11:01:01,400 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:01,400 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-01-11 11:01:01,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:01,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:01,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:01,752 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:01:01,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:01,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:01,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:01,753 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:01:01,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:01,753 INFO 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:01:01,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:01,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:01,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:02,222 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:01:02,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:02,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:02,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:01:02,305 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:01:02,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:02,334 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:01:02,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:02,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:02,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:01:02,454 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:01:02,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:02,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-01-11 11:01:02,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:02,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 11:01:02,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 11:01:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-01-11 11:01:02,475 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-01-11 11:01:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:03,132 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-11 11:01:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 11:01:03,132 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-01-11 11:01:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:03,133 INFO L225 Difference]: With dead ends: 30 [2019-01-11 11:01:03,133 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:01:03,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:01:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-11 11:01:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 11:01:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-11 11:01:03,141 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-01-11 11:01:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:03,141 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-11 11:01:03,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 11:01:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-11 11:01:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 11:01:03,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:03,142 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-01-11 11:01:03,142 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:03,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:03,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-01-11 11:01:03,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:03,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:03,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:03,295 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:01:03,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:03,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:03,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:03,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:01:03,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:03,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 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:01:03,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:03,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:03,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-11 11:01:03,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:03,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:03,335 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:01:03,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:03,445 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:01:03,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:03,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-01-11 11:01:03,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:03,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:01:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:01:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:01:03,465 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-01-11 11:01:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:03,945 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-11 11:01:03,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:01:03,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-11 11:01:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:03,946 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:01:03,946 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 11:01:03,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:01:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 11:01:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-11 11:01:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:01:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-11 11:01:03,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-01-11 11:01:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:03,953 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-11 11:01:03,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:01:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-11 11:01:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 11:01:03,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:03,954 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-11 11:01:03,954 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-01-11 11:01:03,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:03,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:04,304 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:01:04,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:04,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:04,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:04,305 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:01:04,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:04,305 INFO 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:01:04,315 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:04,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:04,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:04,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:04,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:04,521 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:01:04,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:04,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:04,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:01:04,560 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:01:04,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:04,648 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:01:04,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:04,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:04,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:01:04,990 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:01:05,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:05,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-01-11 11:01:05,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:05,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 11:01:05,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 11:01:05,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:05,010 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-01-11 11:01:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:06,190 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-11 11:01:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:01:06,190 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-01-11 11:01:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:06,191 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:01:06,191 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 11:01:06,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-01-11 11:01:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 11:01:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-11 11:01:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:01:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-11 11:01:06,200 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-11 11:01:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:06,200 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-11 11:01:06,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 11:01:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-11 11:01:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 11:01:06,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:06,201 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-11 11:01:06,201 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:06,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-01-11 11:01:06,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:06,688 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:01:06,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:06,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:06,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:06,689 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:01:06,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:06,689 INFO 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:01:06,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:06,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:06,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:07,064 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:01:07,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:07,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:07,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:01:07,105 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:01:07,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:07,132 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:01:07,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:07,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:07,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:01:07,436 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:01:07,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:07,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-01-11 11:01:07,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:07,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 11:01:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 11:01:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:01:07,456 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-01-11 11:01:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:08,318 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-11 11:01:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 11:01:08,319 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-01-11 11:01:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:08,320 INFO L225 Difference]: With dead ends: 36 [2019-01-11 11:01:08,320 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:01:08,321 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:01:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:01:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-11 11:01:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 11:01:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-11 11:01:08,328 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-01-11 11:01:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:08,329 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-11 11:01:08,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 11:01:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-11 11:01:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 11:01:08,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:08,329 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-01-11 11:01:08,330 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-01-11 11:01:08,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,476 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:01:08,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:08,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:08,477 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:01:08,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:08,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:08,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:08,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 11:01:08,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:08,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:08,660 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:01:08,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:08,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-01-11 11:01:08,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:08,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:01:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:01:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:01:08,680 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-01-11 11:01:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:08,808 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-11 11:01:08,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 11:01:08,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-11 11:01:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:08,810 INFO L225 Difference]: With dead ends: 27 [2019-01-11 11:01:08,810 INFO L226 Difference]: Without dead ends: 25 [2019-01-11 11:01:08,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:01:08,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-11 11:01:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-11 11:01:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 11:01:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-11 11:01:08,820 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-01-11 11:01:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:08,820 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-11 11:01:08,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:01:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-11 11:01:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 11:01:08,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:08,821 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-11 11:01:08,822 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-01-11 11:01:08,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:09,942 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:01:09,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:09,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:09,942 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:01:09,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:09,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:09,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:09,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:09,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:09,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:10,307 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:01:10,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:01:10,363 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:01:10,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:10,424 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:01:10,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:01:10,820 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:01:10,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:10,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-01-11 11:01:10,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:10,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-11 11:01:10,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-11 11:01:10,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:01:10,842 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-01-11 11:01:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:12,722 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-11 11:01:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 11:01:12,723 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-01-11 11:01:12,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:12,724 INFO L225 Difference]: With dead ends: 41 [2019-01-11 11:01:12,724 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 11:01:12,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-01-11 11:01:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 11:01:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-11 11:01:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 11:01:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-11 11:01:12,735 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-11 11:01:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:12,735 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-11 11:01:12,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-11 11:01:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-11 11:01:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 11:01:12,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:12,736 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-11 11:01:12,736 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:12,737 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-01-11 11:01:12,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:12,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:12,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:12,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:12,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:13,182 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:01:13,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:13,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:13,183 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:01:13,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,183 INFO 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:01:13,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:13,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:13,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:13,705 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:01:13,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:01:13,748 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:01:13,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:13,766 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:01:13,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:01:13,864 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:01:13,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:13,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-01-11 11:01:13,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:13,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 11:01:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 11:01:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 11:01:13,883 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-01-11 11:01:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:15,095 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-11 11:01:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 11:01:15,096 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-01-11 11:01:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:15,097 INFO L225 Difference]: With dead ends: 42 [2019-01-11 11:01:15,097 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 11:01:15,098 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:01:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 11:01:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-11 11:01:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 11:01:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-11 11:01:15,109 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-01-11 11:01:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:15,109 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-11 11:01:15,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 11:01:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-11 11:01:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 11:01:15,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:15,110 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-01-11 11:01:15,110 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-01-11 11:01:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:15,304 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:01:15,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:15,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:15,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:15,305 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:01:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:15,305 INFO 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:01:15,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:15,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:15,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-11 11:01:15,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:15,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:15,363 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:01:15,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:15,676 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:01:15,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:15,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-01-11 11:01:15,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:15,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 11:01:15,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 11:01:15,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:01:15,696 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-01-11 11:01:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:15,924 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-11 11:01:15,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:01:15,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-11 11:01:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:15,925 INFO L225 Difference]: With dead ends: 31 [2019-01-11 11:01:15,925 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 11:01:15,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-01-11 11:01:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 11:01:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-11 11:01:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:01:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-11 11:01:15,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-01-11 11:01:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:15,936 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-11 11:01:15,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 11:01:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-11 11:01:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 11:01:15,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:15,937 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-11 11:01:15,937 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-01-11 11:01:15,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:15,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:15,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:16,524 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:01:16,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:16,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:16,524 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:01:16,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:16,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:16,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:16,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:16,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:16,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:17,120 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:01:17,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:17,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:17,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:01:17,173 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:01:17,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:17,227 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:01:17,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:17,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:17,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:01:17,967 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:01:17,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:17,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-01-11 11:01:17,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:17,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-11 11:01:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-11 11:01:17,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:01:17,988 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-01-11 11:01:19,149 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-11 11:01:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:20,171 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-11 11:01:20,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:01:20,172 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-01-11 11:01:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:20,173 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:01:20,173 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 11:01:20,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:01:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 11:01:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 11:01:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:01:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-11 11:01:20,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-11 11:01:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:20,185 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-11 11:01:20,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-11 11:01:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-11 11:01:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 11:01:20,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:20,186 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-11 11:01:20,187 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-01-11 11:01:20,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:20,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:20,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:20,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:20,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:21,252 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:01:21,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:21,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:21,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:21,252 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:01:21,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:21,252 INFO 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:01:21,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:21,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:21,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:21,895 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:01:21,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:21,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:21,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:01:21,940 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:01:21,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:21,956 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:01:21,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:21,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:21,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:01:22,080 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:01:22,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:22,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-01-11 11:01:22,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:22,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 11:01:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 11:01:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:01:22,101 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-01-11 11:01:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:23,623 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-11 11:01:23,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 11:01:23,624 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-01-11 11:01:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:23,624 INFO L225 Difference]: With dead ends: 48 [2019-01-11 11:01:23,625 INFO L226 Difference]: Without dead ends: 32 [2019-01-11 11:01:23,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:01:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-11 11:01:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-11 11:01:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:01:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-11 11:01:23,639 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-01-11 11:01:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:23,640 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-11 11:01:23,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 11:01:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-11 11:01:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 11:01:23,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:23,641 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-01-11 11:01:23,641 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-01-11 11:01:23,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:23,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:23,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:24,184 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:01:24,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:24,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:24,185 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:01:24,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,185 INFO 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:01:24,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:24,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:24,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-11 11:01:24,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:24,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:24,256 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:01:24,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:24,761 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:01:24,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:24,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-01-11 11:01:24,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:24,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 11:01:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 11:01:24,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:01:24,781 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-01-11 11:01:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:24,989 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-11 11:01:24,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:01:24,993 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-11 11:01:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:24,993 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:01:24,993 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 11:01:24,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-01-11 11:01:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 11:01:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-11 11:01:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:01:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-11 11:01:25,009 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-01-11 11:01:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:25,009 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-11 11:01:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 11:01:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-11 11:01:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 11:01:25,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:25,010 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-11 11:01:25,010 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-01-11 11:01:25,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:25,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:25,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:25,821 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:01:25,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:25,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:25,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:25,822 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:01:25,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:25,822 INFO 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:01:25,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:25,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:25,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:25,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:25,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:26,408 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:01:26,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:26,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:26,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:01:26,496 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:01:26,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:26,551 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:01:26,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:26,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:26,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:01:27,240 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:01:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:27,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-01-11 11:01:27,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:27,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:01:27,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:01:27,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:01:27,261 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-01-11 11:01:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:29,306 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-11 11:01:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:01:29,307 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-01-11 11:01:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:29,307 INFO L225 Difference]: With dead ends: 53 [2019-01-11 11:01:29,308 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 11:01:29,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2019-01-11 11:01:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 11:01:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-11 11:01:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 11:01:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-11 11:01:29,321 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-11 11:01:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:29,321 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-11 11:01:29,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:01:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-11 11:01:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 11:01:29,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:29,322 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-11 11:01:29,322 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:29,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-01-11 11:01:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:29,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:29,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:30,169 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:01:30,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:30,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:30,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:30,170 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:01:30,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:30,170 INFO 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:01:30,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:30,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:30,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:30,865 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:01:30,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:01:30,915 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:01:30,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:30,928 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:01:30,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:01:31,108 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:01:31,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:31,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-01-11 11:01:31,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:31,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 11:01:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 11:01:31,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 11:01:31,129 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-01-11 11:01:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:33,090 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-11 11:01:33,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:01:33,091 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-01-11 11:01:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:33,091 INFO L225 Difference]: With dead ends: 54 [2019-01-11 11:01:33,091 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 11:01:33,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:01:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 11:01:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-11 11:01:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:01:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-11 11:01:33,107 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-01-11 11:01:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:33,107 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-11 11:01:33,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 11:01:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-11 11:01:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 11:01:33,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:33,108 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-01-11 11:01:33,108 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-01-11 11:01:33,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:33,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:33,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:33,319 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:01:33,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:33,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:33,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:33,320 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:01:33,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:33,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:33,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:33,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:33,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 11:01:33,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:33,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:33,388 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:01:33,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:33,633 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:01:33,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:33,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-01-11 11:01:33,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:33,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-11 11:01:33,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-11 11:01:33,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:01:33,652 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-01-11 11:01:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:33,874 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-11 11:01:33,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:01:33,874 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-01-11 11:01:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:33,874 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:01:33,874 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 11:01:33,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:01:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 11:01:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-11 11:01:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:01:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-11 11:01:33,891 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-01-11 11:01:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:33,891 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-11 11:01:33,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-11 11:01:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-11 11:01:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 11:01:33,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:33,892 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-11 11:01:33,893 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-01-11 11:01:33,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:33,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:33,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:35,145 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:01:35,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:35,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:35,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:35,146 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:01:35,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:35,146 INFO 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:01:35,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:35,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:35,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:35,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:35,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:35,875 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:01:35,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:35,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:35,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:01:35,930 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:01:35,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:35,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:01:35,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:36,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:36,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:01:36,781 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:01:36,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:36,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-01-11 11:01:36,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:36,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 11:01:36,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 11:01:36,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:01:36,801 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-01-11 11:01:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:39,332 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-11 11:01:39,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 11:01:39,332 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-01-11 11:01:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:39,333 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:01:39,333 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 11:01:39,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-01-11 11:01:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 11:01:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-11 11:01:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:01:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-11 11:01:39,349 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-11 11:01:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:39,349 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-11 11:01:39,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 11:01:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-11 11:01:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-11 11:01:39,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:39,350 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-11 11:01:39,350 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:39,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-01-11 11:01:39,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:39,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:39,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:40,364 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:01:40,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:40,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:40,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:40,364 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:01:40,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:40,364 INFO 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:01:40,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:40,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:40,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:41,255 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:01:41,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:41,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:41,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:01:41,313 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:01:41,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:41,326 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:01:41,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:41,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:41,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:01:41,572 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:01:41,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:41,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-01-11 11:01:41,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:41,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 11:01:41,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 11:01:41,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 11:01:41,592 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-01-11 11:01:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:43,919 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-11 11:01:43,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 11:01:43,919 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-01-11 11:01:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:43,920 INFO L225 Difference]: With dead ends: 60 [2019-01-11 11:01:43,920 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 11:01:43,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:01:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 11:01:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-11 11:01:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 11:01:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-11 11:01:43,936 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-01-11 11:01:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:43,936 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-11 11:01:43,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 11:01:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-11 11:01:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 11:01:43,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:43,937 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-01-11 11:01:43,937 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:43,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-01-11 11:01:43,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:43,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:44,169 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:01:44,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:44,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:44,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:44,170 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:01:44,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:44,170 INFO 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:01:44,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:44,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:44,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-11 11:01:44,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:44,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:44,303 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:01:44,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:44,587 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:01:44,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:44,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-01-11 11:01:44,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:44,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-11 11:01:44,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-11 11:01:44,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:01:44,607 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-01-11 11:01:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:44,870 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-11 11:01:44,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:01:44,870 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-11 11:01:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:44,871 INFO L225 Difference]: With dead ends: 43 [2019-01-11 11:01:44,871 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 11:01:44,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-01-11 11:01:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 11:01:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-11 11:01:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:01:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-11 11:01:44,888 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-01-11 11:01:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:44,888 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-11 11:01:44,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-11 11:01:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-11 11:01:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 11:01:44,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:44,889 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-11 11:01:44,889 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:44,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:44,889 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-01-11 11:01:44,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:44,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:44,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:44,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:44,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:46,211 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:01:46,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:46,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:46,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:46,211 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:01:46,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:46,212 INFO 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:01:46,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:46,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:46,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:46,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:46,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:47,072 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:01:47,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:47,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:47,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:01:47,132 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:01:47,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:47,199 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:01:47,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:47,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:47,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:01:48,517 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:01:48,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:48,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-01-11 11:01:48,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:48,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 11:01:48,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 11:01:48,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:01:48,536 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-01-11 11:01:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:51,234 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-11 11:01:51,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:01:51,234 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-01-11 11:01:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:51,235 INFO L225 Difference]: With dead ends: 65 [2019-01-11 11:01:51,235 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 11:01:51,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:01:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 11:01:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-11 11:01:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-11 11:01:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-11 11:01:51,259 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-11 11:01:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:51,260 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-11 11:01:51,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 11:01:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-11 11:01:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 11:01:51,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:51,260 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-11 11:01:51,261 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-01-11 11:01:51,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:51,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:51,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:51,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:51,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:52,239 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:01:52,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:52,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:52,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:52,239 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:01:52,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:52,240 INFO 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:01:52,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:52,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:52,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:53,394 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:01:53,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:53,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:53,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:01:53,475 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:01:53,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:53,494 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:01:53,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:53,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:53,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:01:53,927 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:01:53,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:53,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-01-11 11:01:53,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:53,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 11:01:53,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 11:01:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 11:01:53,946 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-01-11 11:01:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:56,407 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-11 11:01:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 11:01:56,408 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-01-11 11:01:56,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:56,408 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:01:56,408 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:01:56,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:01:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:01:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-11 11:01:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-11 11:01:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-11 11:01:56,432 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-01-11 11:01:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:56,432 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-11 11:01:56,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 11:01:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-11 11:01:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 11:01:56,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:56,433 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-01-11 11:01:56,433 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-01-11 11:01:56,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:56,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:56,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:56,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:56,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:56,748 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:01:56,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:56,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:56,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:56,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:01:56,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:56,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 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:01:56,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:56,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:56,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-11 11:01:56,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:56,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:56,844 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:01:56,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:57,190 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:01:57,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:57,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-01-11 11:01:57,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:57,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 11:01:57,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 11:01:57,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:01:57,209 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-01-11 11:01:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:57,502 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-11 11:01:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 11:01:57,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-11 11:01:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:57,503 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:01:57,503 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:01:57,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-01-11 11:01:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:01:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-11 11:01:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 11:01:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-11 11:01:57,520 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-01-11 11:01:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:57,521 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-11 11:01:57,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 11:01:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-11 11:01:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 11:01:57,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:57,521 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-11 11:01:57,521 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:57,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-01-11 11:01:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:57,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:57,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:59,402 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:01:59,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:59,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:59,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:59,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:01:59,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:59,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 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:01:59,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:59,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:59,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:59,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:59,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:00,556 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:02:00,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:00,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:00,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:02:00,622 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:02:00,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:00,692 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:02:00,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:00,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:00,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:02:01,902 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:02:01,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:01,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-01-11 11:02:01,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:01,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 11:02:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 11:02:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:02:01,921 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-01-11 11:02:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:05,539 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-11 11:02:05,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:02:05,539 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-01-11 11:02:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:05,540 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:02:05,540 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 11:02:05,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2019-01-11 11:02:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 11:02:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-11 11:02:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:02:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-11 11:02:05,563 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-11 11:02:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:05,564 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-11 11:02:05,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 11:02:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-11 11:02:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-11 11:02:05,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:05,564 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-11 11:02:05,565 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-01-11 11:02:05,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:05,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:05,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:05,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:05,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:06,718 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:02:06,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:06,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:06,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:06,719 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:02:06,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:06,719 INFO 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:02:06,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:06,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:06,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:07,943 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:02:07,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:07,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:07,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:02:08,010 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:02:08,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:08,022 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:02:08,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:08,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:08,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:02:08,423 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:02:08,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:08,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-01-11 11:02:08,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:08,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 11:02:08,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 11:02:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:02:08,443 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-01-11 11:02:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:11,598 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-11 11:02:11,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 11:02:11,598 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-01-11 11:02:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:11,599 INFO L225 Difference]: With dead ends: 72 [2019-01-11 11:02:11,599 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 11:02:11,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:02:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 11:02:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-11 11:02:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:02:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-11 11:02:11,619 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-01-11 11:02:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:11,619 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-11 11:02:11,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 11:02:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-11 11:02:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-11 11:02:11,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:11,620 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-01-11 11:02:11,620 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-01-11 11:02:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:11,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:11,992 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:02:11,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:11,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:11,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:11,992 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:02:11,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:11,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:02:12,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:12,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:12,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-11 11:02:12,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:12,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:12,088 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:02:12,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:12,469 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:02:12,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:12,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-01-11 11:02:12,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:12,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-11 11:02:12,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-11 11:02:12,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-01-11 11:02:12,489 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-01-11 11:02:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:12,844 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-11 11:02:12,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:02:12,844 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-01-11 11:02:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:12,845 INFO L225 Difference]: With dead ends: 51 [2019-01-11 11:02:12,845 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 11:02:12,846 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:02:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 11:02:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-11 11:02:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 11:02:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-11 11:02:12,866 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-01-11 11:02:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:12,866 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-11 11:02:12,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-11 11:02:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-11 11:02:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 11:02:12,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:12,867 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-11 11:02:12,867 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-01-11 11:02:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:12,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:12,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:14,456 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:02:14,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:14,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:14,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:14,457 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:02:14,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:14,457 INFO 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:02:14,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:14,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:14,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:14,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:14,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:15,755 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:02:15,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:15,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:15,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:02:15,829 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:02:15,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:15,907 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:02:15,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:15,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:15,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:02:17,473 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:02:17,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:17,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-01-11 11:02:17,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:17,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 11:02:17,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 11:02:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:02:17,493 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-01-11 11:02:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:21,558 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-11 11:02:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 11:02:21,558 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-01-11 11:02:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:21,559 INFO L225 Difference]: With dead ends: 77 [2019-01-11 11:02:21,559 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 11:02:21,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-01-11 11:02:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 11:02:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-11 11:02:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:02:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-11 11:02:21,581 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-11 11:02:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:21,581 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-11 11:02:21,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 11:02:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-11 11:02:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 11:02:21,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:21,582 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-11 11:02:21,582 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-01-11 11:02:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:21,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:21,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:23,296 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:02:23,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:23,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:23,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:23,297 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:02:23,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:23,297 INFO 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:02:23,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:23,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:23,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:25,059 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:02:25,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:25,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:25,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:02:25,130 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:02:25,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:25,142 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:02:25,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:25,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:25,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:02:25,656 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:02:25,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:25,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-01-11 11:02:25,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:25,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 11:02:25,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 11:02:25,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 11:02:25,676 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-01-11 11:02:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:28,708 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-11 11:02:28,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 11:02:28,709 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-01-11 11:02:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:28,710 INFO L225 Difference]: With dead ends: 78 [2019-01-11 11:02:28,710 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 11:02:28,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:02:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 11:02:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-11 11:02:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 11:02:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-11 11:02:28,735 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-01-11 11:02:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:28,735 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-11 11:02:28,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 11:02:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-11 11:02:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 11:02:28,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:28,735 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-01-11 11:02:28,735 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-01-11 11:02:28,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:28,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:28,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:28,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:29,535 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:02:29,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:29,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:29,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:29,536 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:02:29,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:29,536 INFO 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:02:29,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:29,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:29,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-11 11:02:29,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:29,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:29,656 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:02:29,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:30,130 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:02:30,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:30,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-01-11 11:02:30,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:30,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-11 11:02:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-11 11:02:30,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-01-11 11:02:30,151 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-01-11 11:02:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:30,560 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-11 11:02:30,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 11:02:30,561 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-01-11 11:02:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:30,562 INFO L225 Difference]: With dead ends: 55 [2019-01-11 11:02:30,562 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:02:30,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-01-11 11:02:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:02:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-11 11:02:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 11:02:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-11 11:02:30,584 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-01-11 11:02:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:30,584 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-11 11:02:30,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-11 11:02:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-11 11:02:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 11:02:30,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:30,585 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-11 11:02:30,586 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-01-11 11:02:30,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:30,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:30,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:32,077 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:02:32,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:32,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:32,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:32,078 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:02:32,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:32,078 INFO 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:02:32,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:32,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:32,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:32,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:32,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:33,587 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:02:33,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:33,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:33,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:02:33,671 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:02:33,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:33,760 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:02:33,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:33,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:33,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:02:36,106 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:02:36,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:36,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-01-11 11:02:36,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:36,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 11:02:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 11:02:36,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:02:36,125 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-01-11 11:02:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:40,435 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-01-11 11:02:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 11:02:40,436 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-01-11 11:02:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:40,437 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:02:40,437 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:02:40,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-01-11 11:02:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:02:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-11 11:02:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 11:02:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-11 11:02:40,466 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-11 11:02:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:40,466 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-11 11:02:40,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 11:02:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-11 11:02:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 11:02:40,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:40,467 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-11 11:02:40,467 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-01-11 11:02:40,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:40,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:40,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:41,924 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:02:41,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:41,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:41,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:41,925 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:02:41,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:41,925 INFO 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:02:41,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:41,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:41,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:43,551 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:02:43,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:43,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:43,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:02:43,626 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:02:43,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:43,639 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:02:43,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:43,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:43,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:02:44,237 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:02:44,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:44,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-01-11 11:02:44,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:44,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 11:02:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 11:02:44,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 11:02:44,257 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-01-11 11:02:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:48,307 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-01-11 11:02:48,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 11:02:48,307 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-01-11 11:02:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:48,308 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:02:48,308 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 11:02:48,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:02:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 11:02:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-11 11:02:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 11:02:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-11 11:02:48,333 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-01-11 11:02:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:48,333 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-11 11:02:48,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 11:02:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-11 11:02:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 11:02:48,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:48,334 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-01-11 11:02:48,334 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:48,334 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-01-11 11:02:48,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:48,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:48,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:48,733 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:02:48,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:48,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:48,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:48,734 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:02:48,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:48,734 INFO 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:02:48,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:48,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:48,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-11 11:02:48,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:48,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:48,865 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:02:48,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:49,480 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:02:49,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:49,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-01-11 11:02:49,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:49,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 11:02:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 11:02:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:02:49,499 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-01-11 11:02:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:50,171 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-11 11:02:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:02:50,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-01-11 11:02:50,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:50,172 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:02:50,172 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 11:02:50,173 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:02:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 11:02:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-11 11:02:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 11:02:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-11 11:02:50,198 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-01-11 11:02:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:50,199 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-11 11:02:50,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 11:02:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-11 11:02:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 11:02:50,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:50,200 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-11 11:02:50,200 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:50,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:50,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-01-11 11:02:50,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:50,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:50,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:50,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:50,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:52,142 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:02:52,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:52,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:52,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:52,143 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:02:52,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:52,143 INFO 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:02:52,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:52,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:52,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:52,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:52,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:53,869 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:02:53,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:53,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:53,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:02:53,965 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:02:53,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:54,049 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:02:54,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:54,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:54,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:02:56,349 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:02:56,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:56,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-01-11 11:02:56,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:56,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-11 11:02:56,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-11 11:02:56,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:02:56,369 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-01-11 11:03:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:01,465 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-11 11:03:01,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 11:03:01,465 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-01-11 11:03:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:01,466 INFO L225 Difference]: With dead ends: 89 [2019-01-11 11:03:01,467 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 11:03:01,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2019-01-11 11:03:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 11:03:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-11 11:03:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 11:03:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-11 11:03:01,494 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-11 11:03:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:01,494 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-11 11:03:01,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-11 11:03:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-11 11:03:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 11:03:01,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:01,495 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-11 11:03:01,495 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:01,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:01,495 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-01-11 11:03:01,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:01,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:01,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:01,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:01,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:03,330 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:03:03,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:03,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:03,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:03,330 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:03:03,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:03,330 INFO 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:03:03,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:03,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:03,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:05,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:03:05,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:05,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:05,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:03:05,518 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:03:05,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:05,532 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:03:05,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:05,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:05,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:03:06,250 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:03:06,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:06,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-01-11 11:03:06,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:06,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 11:03:06,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 11:03:06,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 11:03:06,271 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-01-11 11:03:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:10,919 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-11 11:03:10,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 11:03:10,919 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-01-11 11:03:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:10,920 INFO L225 Difference]: With dead ends: 90 [2019-01-11 11:03:10,920 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 11:03:10,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:03:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 11:03:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-11 11:03:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-11 11:03:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-11 11:03:10,948 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-01-11 11:03:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:10,949 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-11 11:03:10,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 11:03:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-11 11:03:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-11 11:03:10,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:10,949 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-01-11 11:03:10,949 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:10,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-01-11 11:03:10,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:10,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:10,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:10,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:10,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:11,596 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:03:11,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:11,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:11,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:11,597 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:03:11,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:11,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:11,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:11,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 11:03:11,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:11,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:11,752 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:03:11,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:12,405 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:03:12,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:12,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-01-11 11:03:12,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:12,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-11 11:03:12,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-11 11:03:12,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-01-11 11:03:12,424 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-01-11 11:03:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:12,907 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-11 11:03:12,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:03:12,908 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-01-11 11:03:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:12,908 INFO L225 Difference]: With dead ends: 63 [2019-01-11 11:03:12,908 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 11:03:12,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:03:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 11:03:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-11 11:03:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:03:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-11 11:03:12,938 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-01-11 11:03:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:12,938 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-11 11:03:12,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-11 11:03:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-11 11:03:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 11:03:12,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:12,938 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-11 11:03:12,939 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-01-11 11:03:12,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:12,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:12,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:12,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:15,043 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:03:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:15,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:15,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:15,044 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:03:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:15,044 INFO 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:03:15,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:15,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:15,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:15,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:15,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:17,299 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:03:17,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:17,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:17,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:03:17,390 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:03:17,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:17,484 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:03:17,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:17,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:17,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:03:19,757 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:03:19,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:19,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-01-11 11:03:19,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:19,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 11:03:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 11:03:19,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:03:19,778 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-01-11 11:03:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:25,315 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-11 11:03:25,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-11 11:03:25,316 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-01-11 11:03:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:25,317 INFO L225 Difference]: With dead ends: 95 [2019-01-11 11:03:25,317 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 11:03:25,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-01-11 11:03:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 11:03:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-11 11:03:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 11:03:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-11 11:03:25,350 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-11 11:03:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:25,350 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-11 11:03:25,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 11:03:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-11 11:03:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-11 11:03:25,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:25,351 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-11 11:03:25,351 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-01-11 11:03:25,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:25,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:25,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:27,375 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:03:27,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:27,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:27,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:27,376 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:03:27,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:27,376 INFO 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:03:27,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:27,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:27,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:29,504 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:03:29,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:29,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:29,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:03:29,591 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:03:29,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:29,604 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:03:29,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:29,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:29,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:03:30,467 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:03:30,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:30,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-01-11 11:03:30,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:30,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 11:03:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 11:03:30,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:03:30,488 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-01-11 11:03:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:35,765 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-01-11 11:03:35,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 11:03:35,765 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-01-11 11:03:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:35,765 INFO L225 Difference]: With dead ends: 96 [2019-01-11 11:03:35,765 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 11:03:35,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:03:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 11:03:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-11 11:03:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 11:03:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-01-11 11:03:35,796 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-01-11 11:03:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:35,796 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-01-11 11:03:35,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 11:03:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-01-11 11:03:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-11 11:03:35,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:35,797 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-01-11 11:03:35,797 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-01-11 11:03:35,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:35,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:35,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:35,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:35,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:37,042 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:03:37,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:37,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:37,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:37,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:03:37,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:37,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 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:03:37,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:37,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:37,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-11 11:03:37,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:37,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:37,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:03:37,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:38,023 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:03:38,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-01-11 11:03:38,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:38,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-11 11:03:38,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-11 11:03:38,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-01-11 11:03:38,042 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-01-11 11:03:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:38,580 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-11 11:03:38,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:03:38,581 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-01-11 11:03:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:38,581 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:03:38,581 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:03:38,582 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:03:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:03:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-11 11:03:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-11 11:03:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-11 11:03:38,623 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-01-11 11:03:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:38,623 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-11 11:03:38,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-11 11:03:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-11 11:03:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-11 11:03:38,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:38,624 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-11 11:03:38,624 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:38,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-01-11 11:03:38,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:38,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:38,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:38,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:38,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:40,823 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:03:40,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:40,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:40,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:40,823 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:03:40,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:40,823 INFO 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:03:40,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:40,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:40,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:40,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:40,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:43,871 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:03:43,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:43,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:43,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:03:43,967 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:03:43,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:44,062 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:03:44,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:44,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:44,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:03:46,826 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:03:46,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:46,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-01-11 11:03:46,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:46,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 11:03:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 11:03:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:03:46,846 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-01-11 11:03:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:53,147 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-01-11 11:03:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-11 11:03:53,148 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-01-11 11:03:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:53,149 INFO L225 Difference]: With dead ends: 101 [2019-01-11 11:03:53,149 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 11:03:53,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 11:03:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 11:03:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-11 11:03:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 11:03:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-11 11:03:53,192 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-11 11:03:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:53,192 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-11 11:03:53,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 11:03:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-11 11:03:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 11:03:53,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:53,192 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-11 11:03:53,193 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-01-11 11:03:53,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:53,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:53,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:56,318 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:03:56,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:56,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:56,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:56,318 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:03:56,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:56,319 INFO 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:03:56,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:56,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:56,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:58,837 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:03:58,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:58,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:58,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:03:58,928 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:03:58,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:58,940 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:03:58,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:58,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:58,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:03:59,913 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:03:59,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:59,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-01-11 11:03:59,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:59,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 11:03:59,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 11:03:59,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 11:03:59,934 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-01-11 11:04:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:04,892 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-11 11:04:04,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 11:04:04,892 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-01-11 11:04:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:04,893 INFO L225 Difference]: With dead ends: 102 [2019-01-11 11:04:04,893 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:04:04,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:04:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:04:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-11 11:04:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 11:04:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-11 11:04:04,934 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-01-11 11:04:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:04,935 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-11 11:04:04,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 11:04:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-11 11:04:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 11:04:04,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:04,935 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-01-11 11:04:04,935 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-01-11 11:04:04,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:04,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:04,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:04,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:05,524 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:04:05,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:05,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:05,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:05,524 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:04:05,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:05,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:05,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:05,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:05,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-11 11:04:05,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:05,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:05,724 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:04:05,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:07,039 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:04:07,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:07,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-01-11 11:04:07,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:07,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-11 11:04:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-11 11:04:07,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:04:07,059 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-01-11 11:04:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:07,658 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-01-11 11:04:07,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:04:07,658 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-01-11 11:04:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:07,659 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:04:07,659 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 11:04:07,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-01-11 11:04:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 11:04:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-11 11:04:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 11:04:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-11 11:04:07,695 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-01-11 11:04:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:07,695 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-11 11:04:07,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-11 11:04:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-11 11:04:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 11:04:07,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:07,696 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-11 11:04:07,696 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:07,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-01-11 11:04:07,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:07,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:07,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:07,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:07,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:09,975 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:04:09,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:09,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:09,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:09,976 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:04:09,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:09,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:09,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:09,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:10,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:10,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:10,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:12,785 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:04:12,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:12,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:12,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:04:12,901 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:04:12,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:13,004 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:04:13,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:13,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:13,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:04:15,887 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:04:15,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:15,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-01-11 11:04:15,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:15,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 11:04:15,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 11:04:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:04:15,918 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-01-11 11:04:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:23,887 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-11 11:04:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-11 11:04:23,888 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-01-11 11:04:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:23,889 INFO L225 Difference]: With dead ends: 107 [2019-01-11 11:04:23,889 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:04:23,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-01-11 11:04:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:04:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-11 11:04:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:04:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-11 11:04:23,928 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-11 11:04:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:23,929 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-11 11:04:23,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 11:04:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-11 11:04:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 11:04:23,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:23,929 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-11 11:04:23,929 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:23,930 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-01-11 11:04:23,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:23,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:23,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:23,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:23,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:26,667 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:04:26,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:26,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:26,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:26,667 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:04:26,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:26,668 INFO 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:04:26,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:26,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:26,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:29,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:04:29,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:29,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:29,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:04:29,590 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:04:29,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:29,604 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:04:29,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:29,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:29,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:04:31,438 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:04:31,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:31,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-01-11 11:04:31,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:31,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 11:04:31,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 11:04:31,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:04:31,468 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-01-11 11:04:34,129 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-11 11:04:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:38,663 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-11 11:04:38,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 11:04:38,664 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-01-11 11:04:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:38,665 INFO L225 Difference]: With dead ends: 108 [2019-01-11 11:04:38,665 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 11:04:38,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:04:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 11:04:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-11 11:04:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-11 11:04:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-01-11 11:04:38,703 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-01-11 11:04:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:38,703 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-01-11 11:04:38,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 11:04:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-01-11 11:04:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 11:04:38,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:38,704 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-01-11 11:04:38,704 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-01-11 11:04:38,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:38,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:38,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:40,943 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:04:40,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:40,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:40,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:40,944 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:04:40,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:40,944 INFO 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:04:40,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:40,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:41,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 11:04:41,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:41,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:41,181 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:04:41,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:42,109 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:04:42,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:42,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-01-11 11:04:42,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:42,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-11 11:04:42,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-11 11:04:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-01-11 11:04:42,131 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-01-11 11:04:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:42,951 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-11 11:04:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 11:04:42,951 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-01-11 11:04:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:42,952 INFO L225 Difference]: With dead ends: 75 [2019-01-11 11:04:42,952 INFO L226 Difference]: Without dead ends: 73 [2019-01-11 11:04:42,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:04:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-11 11:04:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-11 11:04:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 11:04:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-11 11:04:42,991 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-01-11 11:04:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:42,991 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-11 11:04:42,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-11 11:04:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-11 11:04:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 11:04:42,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:42,992 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-11 11:04:42,992 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-01-11 11:04:42,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:42,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:42,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:42,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:45,608 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:04:45,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:45,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:45,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:45,609 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:04:45,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:45,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:45,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:45,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:45,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:45,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:45,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:48,809 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:04:48,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:48,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:48,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:04:48,921 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:04:48,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:49,026 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:04:49,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:49,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:49,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:04:52,307 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:04:52,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:52,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-01-11 11:04:52,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:52,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 11:04:52,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 11:04:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:04:52,327 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-01-11 11:05:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:00,633 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-11 11:05:00,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-11 11:05:00,633 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-01-11 11:05:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:00,634 INFO L225 Difference]: With dead ends: 113 [2019-01-11 11:05:00,634 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 11:05:00,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-01-11 11:05:00,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 11:05:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-11 11:05:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 11:05:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-11 11:05:00,676 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-11 11:05:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:00,676 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-11 11:05:00,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 11:05:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-11 11:05:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-11 11:05:00,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:00,677 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-11 11:05:00,677 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-01-11 11:05:00,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:00,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:00,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:00,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:00,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:03,681 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:05:03,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:03,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:03,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:03,682 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:05:03,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:03,682 INFO 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:05:03,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:03,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:03,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:06,873 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:05:06,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:06,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:06,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:05:06,978 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:05:06,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:06,991 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:05:06,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:06,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:06,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:05:08,458 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:05:08,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:08,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-01-11 11:05:08,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:08,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 11:05:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 11:05:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-01-11 11:05:08,478 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-01-11 11:05:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:15,170 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-01-11 11:05:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 11:05:15,170 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-01-11 11:05:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:15,171 INFO L225 Difference]: With dead ends: 114 [2019-01-11 11:05:15,171 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 11:05:15,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:05:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 11:05:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-11 11:05:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 11:05:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-01-11 11:05:15,212 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-01-11 11:05:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:15,213 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-01-11 11:05:15,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 11:05:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-01-11 11:05:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-11 11:05:15,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:15,214 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-01-11 11:05:15,214 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-01-11 11:05:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:15,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:15,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:15,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:15,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:16,406 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:05:16,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:16,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:16,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:16,407 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:05:16,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:16,407 INFO 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:05:16,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:16,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:16,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-11 11:05:16,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:16,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:16,662 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:05:16,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:17,734 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:05:17,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:17,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-01-11 11:05:17,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:17,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-11 11:05:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-11 11:05:17,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-01-11 11:05:17,755 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-01-11 11:05:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:18,733 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-01-11 11:05:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:05:18,733 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-01-11 11:05:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:18,734 INFO L225 Difference]: With dead ends: 79 [2019-01-11 11:05:18,734 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 11:05:18,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-01-11 11:05:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 11:05:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-11 11:05:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:05:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-11 11:05:18,798 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-01-11 11:05:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:18,798 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-11 11:05:18,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-11 11:05:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-11 11:05:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 11:05:18,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:18,799 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-11 11:05:18,799 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:18,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-01-11 11:05:18,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:18,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:18,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:22,034 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:05:22,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:22,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:22,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:22,035 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:05:22,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:22,035 INFO 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:05:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:22,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:22,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:22,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:22,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:25,455 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:05:25,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:25,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:25,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:05:25,573 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:05:25,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:25,682 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:05:25,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:25,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:25,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:05:29,531 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:05:29,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:29,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-01-11 11:05:29,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:29,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-11 11:05:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-11 11:05:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:05:29,550 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-01-11 11:05:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:39,279 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-01-11 11:05:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-11 11:05:39,280 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-01-11 11:05:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:39,281 INFO L225 Difference]: With dead ends: 119 [2019-01-11 11:05:39,281 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 11:05:39,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-01-11 11:05:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 11:05:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-11 11:05:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 11:05:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-11 11:05:39,349 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-11 11:05:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:39,349 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-11 11:05:39,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-11 11:05:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-11 11:05:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-11 11:05:39,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:39,350 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-11 11:05:39,350 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-01-11 11:05:39,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:39,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:39,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:42,970 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:05:42,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:42,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:42,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:42,970 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:05:42,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:42,970 INFO 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:05:42,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:42,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:43,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:46,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:05:46,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:46,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:46,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:05:46,723 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:05:46,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:46,736 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:05:46,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:46,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:46,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:05:47,967 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:05:47,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:47,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-01-11 11:05:47,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:47,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-11 11:05:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-11 11:05:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:05:47,987 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-01-11 11:05:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:56,284 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-01-11 11:05:56,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 11:05:56,284 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-01-11 11:05:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:56,285 INFO L225 Difference]: With dead ends: 120 [2019-01-11 11:05:56,286 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 11:05:56,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:05:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 11:05:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-11 11:05:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 11:05:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-11 11:05:56,340 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-01-11 11:05:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:56,340 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-11 11:05:56,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-11 11:05:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-11 11:05:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-11 11:05:56,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:56,341 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-01-11 11:05:56,341 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:56,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-01-11 11:05:56,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:56,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:56,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:56,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:56,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:57,709 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:05:57,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:57,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:57,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:57,710 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:05:57,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:57,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05:57,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:57,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:57,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-11 11:05:57,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:57,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:57,989 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:05:57,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:00,258 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:06:00,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:00,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-01-11 11:06:00,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:00,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-11 11:06:00,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-11 11:06:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:06:00,281 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-01-11 11:06:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:01,132 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-01-11 11:06:01,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 11:06:01,133 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-01-11 11:06:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:01,133 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:06:01,133 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 11:06:01,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-01-11 11:06:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 11:06:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-11 11:06:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 11:06:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-11 11:06:01,183 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-01-11 11:06:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:01,184 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-11 11:06:01,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-11 11:06:01,184 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-11 11:06:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 11:06:01,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:01,184 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-11 11:06:01,185 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:01,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:01,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-01-11 11:06:01,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:01,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:01,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:01,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:01,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:04,655 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:06:04,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:04,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:04,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:04,663 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:06:04,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:04,663 INFO 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:06:04,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:04,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:04,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:04,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:04,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:08,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:06:08,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:08,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:08,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:06:08,318 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:06:08,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:08,433 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:06:08,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:08,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:08,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:06:12,696 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:06:12,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:12,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-01-11 11:06:12,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:12,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-11 11:06:12,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-11 11:06:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:06:12,716 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-01-11 11:06:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:22,749 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-11 11:06:22,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-01-11 11:06:22,749 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-01-11 11:06:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:22,750 INFO L225 Difference]: With dead ends: 125 [2019-01-11 11:06:22,750 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:06:22,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-01-11 11:06:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:06:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-11 11:06:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 11:06:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-11 11:06:22,819 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-11 11:06:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:22,819 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-11 11:06:22,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-11 11:06:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-11 11:06:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 11:06:22,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:22,820 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-11 11:06:22,820 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-01-11 11:06:22,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:22,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:22,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:22,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:22,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:26,326 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:06:26,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:26,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:26,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:26,327 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:06:26,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:26,327 INFO 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:06:26,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:26,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:26,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:30,226 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:06:30,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:30,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:30,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:06:30,339 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:06:30,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:30,356 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:06:30,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:30,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:30,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:06:31,759 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:06:31,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:31,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-01-11 11:06:31,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:31,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-11 11:06:31,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-11 11:06:31,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-01-11 11:06:31,779 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-01-11 11:06:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:40,608 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-01-11 11:06:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 11:06:40,608 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-01-11 11:06:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:40,609 INFO L225 Difference]: With dead ends: 126 [2019-01-11 11:06:40,609 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 11:06:40,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:06:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 11:06:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-11 11:06:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:06:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-11 11:06:40,659 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-01-11 11:06:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:40,660 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-11 11:06:40,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-11 11:06:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-11 11:06:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 11:06:40,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:40,661 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-01-11 11:06:40,661 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-01-11 11:06:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:40,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:40,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:41,418 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:06:41,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:41,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:41,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:41,419 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:06:41,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:41,419 INFO 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:06:41,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:41,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:41,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-11 11:06:41,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:41,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:41,762 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:06:41,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:42,954 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:06:42,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:42,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-01-11 11:06:42,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:42,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-11 11:06:42,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-11 11:06:42,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-01-11 11:06:42,976 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-01-11 11:06:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:43,865 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-11 11:06:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 11:06:43,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-01-11 11:06:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:43,867 INFO L225 Difference]: With dead ends: 87 [2019-01-11 11:06:43,867 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 11:06:43,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-01-11 11:06:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 11:06:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-11 11:06:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 11:06:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-11 11:06:43,922 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-01-11 11:06:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:43,922 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-11 11:06:43,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-11 11:06:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-11 11:06:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 11:06:43,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:43,922 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-11 11:06:43,923 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-01-11 11:06:43,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:43,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:43,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:47,365 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:06:47,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:47,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:47,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:47,365 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:06:47,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:47,366 INFO 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:06:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:47,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:47,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:47,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:47,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:51,520 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:06:51,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:51,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:51,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:06:51,640 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:06:51,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:51,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:06:51,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:51,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:51,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:06:56,439 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:06:56,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:56,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-01-11 11:06:56,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:56,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-11 11:06:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-11 11:06:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:06:56,460 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-01-11 11:07:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:07,614 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-01-11 11:07:07,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-01-11 11:07:07,614 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-01-11 11:07:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:07,615 INFO L225 Difference]: With dead ends: 131 [2019-01-11 11:07:07,615 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 11:07:07,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-01-11 11:07:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 11:07:07,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-11 11:07:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 11:07:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-11 11:07:07,680 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-11 11:07:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:07,680 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-11 11:07:07,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-11 11:07:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-11 11:07:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 11:07:07,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:07,681 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-11 11:07:07,681 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-01-11 11:07:07,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:07,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:07,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:11,534 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:07:11,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:11,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:11,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:11,535 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:07:11,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:11,535 INFO 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:07:11,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:11,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:07:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:11,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:15,532 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:07:15,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:15,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:15,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:07:15,651 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:07:15,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:15,664 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:07:15,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:15,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:15,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:07:17,477 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:07:17,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:17,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-01-11 11:07:17,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:17,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-11 11:07:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-11 11:07:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:07:17,512 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-01-11 11:07:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:27,174 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-01-11 11:07:27,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 11:07:27,174 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-01-11 11:07:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:27,175 INFO L225 Difference]: With dead ends: 132 [2019-01-11 11:07:27,175 INFO L226 Difference]: Without dead ends: 88 [2019-01-11 11:07:27,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:07:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-11 11:07:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-11 11:07:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-11 11:07:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-01-11 11:07:27,233 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-01-11 11:07:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:27,233 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-01-11 11:07:27,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-11 11:07:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-01-11 11:07:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-11 11:07:27,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:27,234 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-01-11 11:07:27,235 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-01-11 11:07:27,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:27,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:27,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:27,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:27,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:28,071 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:07:28,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:28,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:28,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:28,072 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:07:28,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:28,072 INFO 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:07:28,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:28,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:28,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-11 11:07:28,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:28,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:28,419 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:07:28,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:29,670 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:07:29,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:29,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-01-11 11:07:29,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:29,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-11 11:07:29,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-11 11:07:29,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-01-11 11:07:29,691 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-01-11 11:07:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:30,630 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-01-11 11:07:30,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 11:07:30,631 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-01-11 11:07:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:30,632 INFO L225 Difference]: With dead ends: 91 [2019-01-11 11:07:30,632 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:07:30,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-01-11 11:07:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:07:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-11 11:07:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-11 11:07:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-11 11:07:30,725 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-01-11 11:07:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:30,725 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-11 11:07:30,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-11 11:07:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-11 11:07:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-11 11:07:30,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:30,726 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-11 11:07:30,726 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:30,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-01-11 11:07:30,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:30,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:30,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:34,819 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:07:34,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:34,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:34,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:34,819 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:07:34,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:34,819 INFO 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:07:34,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:07:34,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:07:34,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:07:34,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:34,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:39,411 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:07:39,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:39,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:39,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:07:39,543 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:07:39,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:39,661 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:07:39,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:39,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:39,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:07:44,913 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:07:44,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:44,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-01-11 11:07:44,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:44,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-11 11:07:44,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-11 11:07:44,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:07:44,933 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-01-11 11:07:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:57,568 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-01-11 11:07:57,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-01-11 11:07:57,568 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-01-11 11:07:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:57,569 INFO L225 Difference]: With dead ends: 137 [2019-01-11 11:07:57,569 INFO L226 Difference]: Without dead ends: 91 [2019-01-11 11:07:57,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2019-01-11 11:07:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-11 11:07:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-11 11:07:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:07:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-11 11:07:57,628 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-11 11:07:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:57,628 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-11 11:07:57,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-11 11:07:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-11 11:07:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 11:07:57,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:57,629 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-11 11:07:57,629 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:57,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-01-11 11:07:57,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:57,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:57,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:57,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:57,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:01,578 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:08:01,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:01,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:01,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:01,579 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:08:01,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:01,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:01,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:01,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:01,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:06,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:08:06,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:06,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:06,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:08:06,417 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:08:06,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:06,431 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:08:06,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:06,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:06,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:08:08,518 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:08:08,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:08,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-01-11 11:08:08,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:08,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-11 11:08:08,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-11 11:08:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-01-11 11:08:08,538 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-01-11 11:08:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:19,195 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-01-11 11:08:19,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-11 11:08:19,195 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-01-11 11:08:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:19,196 INFO L225 Difference]: With dead ends: 138 [2019-01-11 11:08:19,196 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 11:08:19,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:08:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 11:08:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-11 11:08:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-11 11:08:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-01-11 11:08:19,258 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-01-11 11:08:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:19,258 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-01-11 11:08:19,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-11 11:08:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-01-11 11:08:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-11 11:08:19,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:19,258 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-01-11 11:08:19,259 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:19,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-01-11 11:08:19,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:19,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:19,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:19,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:19,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:20,208 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:08:20,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:20,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:20,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:20,208 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:08:20,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:20,209 INFO 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:08:20,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:08:20,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:08:20,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-11 11:08:20,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:20,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:20,602 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:08:20,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:21,995 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:08:22,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-01-11 11:08:22,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:22,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:08:22,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:08:22,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:08:22,019 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-01-11 11:08:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:23,254 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-01-11 11:08:23,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 11:08:23,254 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-01-11 11:08:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:23,255 INFO L225 Difference]: With dead ends: 95 [2019-01-11 11:08:23,255 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 11:08:23,255 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:08:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 11:08:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-11 11:08:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 11:08:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-11 11:08:23,321 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-01-11 11:08:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:23,321 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-11 11:08:23,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:08:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-11 11:08:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-11 11:08:23,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:23,322 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-11 11:08:23,322 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-01-11 11:08:23,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:23,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:23,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:23,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:23,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:27,353 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:08:27,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:27,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:27,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:27,354 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:08:27,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:27,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:27,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:08:27,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:08:27,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:08:27,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:27,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:32,317 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:08:32,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:32,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:32,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:08:32,469 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:08:32,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:32,652 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:08:32,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:32,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:32,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:08:38,463 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:08:38,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:38,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-01-11 11:08:38,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:38,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-11 11:08:38,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-11 11:08:38,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:08:38,483 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-01-11 11:08:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:51,322 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-01-11 11:08:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-01-11 11:08:51,322 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-01-11 11:08:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:51,323 INFO L225 Difference]: With dead ends: 143 [2019-01-11 11:08:51,323 INFO L226 Difference]: Without dead ends: 95 [2019-01-11 11:08:51,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-01-11 11:08:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-11 11:08:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-11 11:08:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 11:08:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-11 11:08:51,390 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-11 11:08:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:51,390 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-11 11:08:51,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-11 11:08:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-11 11:08:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-11 11:08:51,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:51,391 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-11 11:08:51,391 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:51,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:51,391 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-01-11 11:08:51,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:51,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:51,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:55,762 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:08:55,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:55,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:55,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:55,763 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:08:55,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:55,763 INFO 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:08:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:55,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:55,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:00,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:09:00,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:00,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:00,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:09:00,880 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:09:00,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:00,892 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:09:00,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:00,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:00,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:09:02,812 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:09:02,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:02,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-01-11 11:09:02,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:02,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-11 11:09:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-11 11:09:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:09:02,832 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-01-11 11:09:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:14,253 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-01-11 11:09:14,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-11 11:09:14,253 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-01-11 11:09:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:14,254 INFO L225 Difference]: With dead ends: 144 [2019-01-11 11:09:14,254 INFO L226 Difference]: Without dead ends: 96 [2019-01-11 11:09:14,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:09:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-11 11:09:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-11 11:09:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 11:09:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-01-11 11:09:14,319 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-01-11 11:09:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:14,319 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-01-11 11:09:14,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-11 11:09:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-01-11 11:09:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 11:09:14,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:14,320 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-01-11 11:09:14,320 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-01-11 11:09:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:14,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:14,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:15,229 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:09:15,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:15,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:15,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:15,230 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:09:15,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:15,230 INFO 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:09:15,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:09:15,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:09:15,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 11:09:15,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:15,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:15,658 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:09:15,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:17,240 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:09:17,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:17,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-01-11 11:09:17,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:17,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-11 11:09:17,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-11 11:09:17,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-01-11 11:09:17,261 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-01-11 11:09:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:18,300 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-01-11 11:09:18,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-11 11:09:18,300 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-01-11 11:09:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:18,301 INFO L225 Difference]: With dead ends: 99 [2019-01-11 11:09:18,301 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 11:09:18,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:09:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 11:09:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-11 11:09:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 11:09:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-11 11:09:18,371 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-01-11 11:09:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:18,371 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-11 11:09:18,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-11 11:09:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-11 11:09:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 11:09:18,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:18,372 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-11 11:09:18,372 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-01-11 11:09:18,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:18,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:18,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:18,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:22,803 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:09:22,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:22,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:22,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:22,804 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:09:22,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:22,804 INFO 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:09:22,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:09:22,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:09:22,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:09:22,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:22,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:28,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:09:28,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:28,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:28,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:09:28,210 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:09:28,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:28,340 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:09:28,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:28,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:28,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:09:34,590 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:09:34,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:34,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-01-11 11:09:34,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:34,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-01-11 11:09:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-01-11 11:09:34,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:09:34,611 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-01-11 11:09:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:49,123 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-01-11 11:09:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-01-11 11:09:49,124 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-01-11 11:09:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:49,125 INFO L225 Difference]: With dead ends: 149 [2019-01-11 11:09:49,125 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 11:09:49,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-01-11 11:09:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 11:09:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-11 11:09:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-11 11:09:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-11 11:09:49,195 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-11 11:09:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:49,195 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-11 11:09:49,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-01-11 11:09:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-11 11:09:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 11:09:49,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:49,196 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-11 11:09:49,196 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-01-11 11:09:49,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:49,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:49,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:49,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:49,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:53,612 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:09:53,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:53,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:53,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:53,613 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:09:53,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:53,613 INFO 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:09:53,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:53,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:09:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:53,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:58,932 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:09:58,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:58,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:58,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:09:59,072 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:09:59,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:59,087 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:09:59,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:59,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:59,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:10:01,529 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:10:01,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:01,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-01-11 11:10:01,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:01,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-11 11:10:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-11 11:10:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-01-11 11:10:01,549 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-01-11 11:10:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:12,702 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-01-11 11:10:12,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-11 11:10:12,703 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-01-11 11:10:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:12,704 INFO L225 Difference]: With dead ends: 150 [2019-01-11 11:10:12,704 INFO L226 Difference]: Without dead ends: 100 [2019-01-11 11:10:12,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:10:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-11 11:10:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-11 11:10:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 11:10:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-11 11:10:12,777 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-01-11 11:10:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:12,777 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-11 11:10:12,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-11 11:10:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-11 11:10:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 11:10:12,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:12,778 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-01-11 11:10:12,778 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:12,779 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-01-11 11:10:12,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:12,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:12,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:13,747 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:10:13,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:13,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:13,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:13,748 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:10:13,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:13,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:13,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:10:13,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:10:14,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-11 11:10:14,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:14,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:14,217 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:10:14,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:16,163 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:10:16,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:16,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-01-11 11:10:16,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:16,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-11 11:10:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-11 11:10:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-01-11 11:10:16,184 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-01-11 11:10:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:17,291 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-01-11 11:10:17,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-11 11:10:17,291 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-11 11:10:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:17,292 INFO L225 Difference]: With dead ends: 103 [2019-01-11 11:10:17,292 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 11:10:17,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-01-11 11:10:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 11:10:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-11 11:10:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:10:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-11 11:10:17,366 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-01-11 11:10:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:17,366 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-11 11:10:17,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-11 11:10:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-11 11:10:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 11:10:17,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:17,367 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-11 11:10:17,367 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-01-11 11:10:17,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:17,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:17,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:17,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:17,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:22,217 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:10:22,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:22,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:22,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:22,218 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:10:22,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:22,218 INFO 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:10:22,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:10:22,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:10:22,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:10:22,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:22,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:27,927 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:10:27,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:27,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:27,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:10:28,073 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:10:28,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:28,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:10:28,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:28,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:28,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:10:34,705 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:10:34,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:34,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-01-11 11:10:34,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:34,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-01-11 11:10:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-01-11 11:10:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:10:34,725 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-01-11 11:10:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:49,917 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-01-11 11:10:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-01-11 11:10:49,918 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-01-11 11:10:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:49,918 INFO L225 Difference]: With dead ends: 155 [2019-01-11 11:10:49,918 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 11:10:49,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-01-11 11:10:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 11:10:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-11 11:10:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 11:10:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-11 11:10:49,993 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-11 11:10:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:49,994 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-11 11:10:49,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-01-11 11:10:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-11 11:10:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 11:10:49,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:49,994 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-11 11:10:49,994 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:49,995 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-01-11 11:10:49,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:49,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:49,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:54,839 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:10:54,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:54,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:54,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:54,840 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:10:54,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:54,840 INFO 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:10:54,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:54,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:54,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:00,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:11:00,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:00,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:00,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:11:01,012 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:11:01,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:01,025 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:11:01,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:11:03,565 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:11:03,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:03,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-01-11 11:11:03,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:03,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-11 11:11:03,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-11 11:11:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:11:03,586 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-01-11 11:11:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:15,223 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-01-11 11:11:15,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-11 11:11:15,223 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-01-11 11:11:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:15,224 INFO L225 Difference]: With dead ends: 156 [2019-01-11 11:11:15,224 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 11:11:15,226 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:11:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 11:11:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-11 11:11:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-11 11:11:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-11 11:11:15,301 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-01-11 11:11:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:15,302 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-11 11:11:15,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-11 11:11:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-11 11:11:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 11:11:15,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:15,302 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-01-11 11:11:15,302 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-01-11 11:11:15,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:15,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:15,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:15,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:15,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:16,325 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:11:16,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:16,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:16,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:16,325 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:11:16,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:16,326 INFO 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:11:16,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:16,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:16,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-11 11:11:16,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:16,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:16,852 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:11:16,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:18,789 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:11:18,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:18,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-01-11 11:11:18,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:18,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 11:11:18,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 11:11:18,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:11:18,810 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-01-11 11:11:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:20,046 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-01-11 11:11:20,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-11 11:11:20,047 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-01-11 11:11:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:20,047 INFO L225 Difference]: With dead ends: 107 [2019-01-11 11:11:20,047 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 11:11:20,048 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:11:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 11:11:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-11 11:11:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 11:11:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-11 11:11:20,131 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-01-11 11:11:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:20,131 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-11 11:11:20,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 11:11:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-11 11:11:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 11:11:20,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:20,132 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-11 11:11:20,132 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-01-11 11:11:20,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:20,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:20,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:25,224 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:11:25,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:25,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:25,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:25,225 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:11:25,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:25,225 INFO 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:11:25,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:11:25,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:11:25,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:11:25,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:25,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:31,375 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:11:31,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:11:31,530 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:11:31,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:31,664 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:11:31,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:31,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:11:38,672 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:11:38,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:38,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-01-11 11:11:38,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:38,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-11 11:11:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-11 11:11:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:11:38,692 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-01-11 11:11:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:54,250 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-11 11:11:54,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-01-11 11:11:54,251 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-01-11 11:11:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:54,252 INFO L225 Difference]: With dead ends: 161 [2019-01-11 11:11:54,252 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 11:11:54,254 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:11:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 11:11:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-11 11:11:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 11:11:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-11 11:11:54,335 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-11 11:11:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:54,335 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-11 11:11:54,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-11 11:11:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-11 11:11:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 11:11:54,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:54,335 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-11 11:11:54,335 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-01-11 11:11:54,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:54,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:54,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:59,581 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:11:59,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:59,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:59,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:59,581 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:11:59,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:59,581 INFO 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:11:59,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:59,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:59,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:06,076 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:12:06,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:06,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:06,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:12:06,242 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:12:06,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:06,257 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:12:06,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:06,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:06,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:12:09,165 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:12:09,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:09,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2019-01-11 11:12:09,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:09,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-11 11:12:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-11 11:12:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:12:09,186 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2019-01-11 11:12:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:21,801 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-01-11 11:12:21,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-11 11:12:21,801 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2019-01-11 11:12:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:21,802 INFO L225 Difference]: With dead ends: 162 [2019-01-11 11:12:21,802 INFO L226 Difference]: Without dead ends: 108 [2019-01-11 11:12:21,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 11:12:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-11 11:12:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-11 11:12:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 11:12:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-01-11 11:12:21,883 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-01-11 11:12:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:21,883 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-01-11 11:12:21,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-11 11:12:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-01-11 11:12:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-11 11:12:21,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:21,883 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2019-01-11 11:12:21,883 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2019-01-11 11:12:21,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:21,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:21,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:23,114 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:12:23,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:23,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:23,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:23,114 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:12:23,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:23,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:12:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:12:23,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:12:23,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 11:12:23,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:23,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:23,684 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:12:23,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:25,845 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:12:25,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:25,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-01-11 11:12:25,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:25,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-11 11:12:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-11 11:12:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-01-11 11:12:25,866 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2019-01-11 11:12:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:27,103 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-01-11 11:12:27,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-11 11:12:27,104 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-01-11 11:12:27,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:27,104 INFO L225 Difference]: With dead ends: 111 [2019-01-11 11:12:27,104 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 11:12:27,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:12:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 11:12:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-11 11:12:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-11 11:12:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-11 11:12:27,205 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-01-11 11:12:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:27,205 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-11 11:12:27,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-11 11:12:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-11 11:12:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-11 11:12:27,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:27,206 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-11 11:12:27,206 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2019-01-11 11:12:27,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:27,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:27,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:27,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:27,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:32,950 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:12:32,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:32,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:32,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:32,951 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:12:32,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:32,951 INFO 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:12:32,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:12:32,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:12:33,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:12:33,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:33,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:40,049 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:12:40,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:40,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:40,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-11 11:12:40,210 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:12:40,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:40,391 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:12:40,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:40,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:40,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-11 11:12:47,868 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:12:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2019-01-11 11:12:47,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:47,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-01-11 11:12:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-01-11 11:12:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 11:12:47,890 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2019-01-11 11:13:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:04,917 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-01-11 11:13:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-01-11 11:13:04,918 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2019-01-11 11:13:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:04,919 INFO L225 Difference]: With dead ends: 167 [2019-01-11 11:13:04,919 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 11:13:04,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2019-01-11 11:13:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 11:13:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-11 11:13:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 11:13:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-11 11:13:05,006 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-11 11:13:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:05,006 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-11 11:13:05,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-01-11 11:13:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-11 11:13:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 11:13:05,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:05,007 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-11 11:13:05,007 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:05,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2019-01-11 11:13:05,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:05,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:05,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:05,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:05,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:10,604 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:13:10,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:10,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:10,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:10,605 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:13:10,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:10,605 INFO 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:13:10,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:10,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:10,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:17,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-11 11:13:17,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-11 11:13:17,381 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:13:17,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:17,396 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:13:17,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-11 11:13:20,285 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:13:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:20,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2019-01-11 11:13:20,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:20,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-11 11:13:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-11 11:13:20,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:13:20,306 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states. [2019-01-11 11:13:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:33,824 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2019-01-11 11:13:33,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-11 11:13:33,825 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 110 [2019-01-11 11:13:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:33,826 INFO L225 Difference]: With dead ends: 168 [2019-01-11 11:13:33,826 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 11:13:33,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 122 SyntacticMatches, 41 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8226 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=1042, Invalid=48020, Unknown=0, NotChecked=0, Total=49062 [2019-01-11 11:13:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 11:13:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-11 11:13:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 11:13:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-01-11 11:13:33,916 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-01-11 11:13:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:33,917 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-01-11 11:13:33,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-11 11:13:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-01-11 11:13:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-11 11:13:33,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:33,917 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1] [2019-01-11 11:13:33,917 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1280933780, now seen corresponding path program 80 times [2019-01-11 11:13:33,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:33,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:33,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:35,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:35,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:35,414 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:13:35,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:35,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:35,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:36,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-11 11:13:36,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:36,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:36,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:38,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:38,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2019-01-11 11:13:38,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:38,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-11 11:13:38,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-11 11:13:38,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-01-11 11:13:38,168 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 57 states.