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/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:21:34,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:21:34,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:21:34,254 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:21:34,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:21:34,255 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:21:34,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:21:34,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:21:34,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:21:34,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:21:34,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:21:34,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:21:34,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:21:34,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:21:34,265 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:21:34,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:21:34,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:21:34,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:21:34,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:21:34,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:21:34,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:21:34,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:21:34,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:21:34,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:21:34,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:21:34,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:21:34,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:21:34,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:21:34,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:21:34,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:21:34,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:21:34,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:21:34,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:21:34,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:21:34,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:21:34,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:21:34,287 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 [2018-12-03 15:21:34,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:21:34,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:21:34,300 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:21:34,301 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:21:34,301 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:21:34,301 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:21:34,301 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:21:34,301 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:21:34,302 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:21:34,302 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:21:34,302 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:21:34,302 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:21:34,303 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:21:34,303 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:21:34,303 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:21:34,304 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:21:34,304 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:21:34,304 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:21:34,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:21:34,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:21:34,305 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:21:34,305 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:21:34,305 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:21:34,305 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:21:34,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:21:34,306 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:21:34,306 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:21:34,306 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:21:34,306 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:21:34,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:21:34,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:21:34,307 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:21:34,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:34,307 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:21:34,308 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:21:34,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:21:34,308 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:21:34,308 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:21:34,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:21:34,309 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:21:34,309 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:21:34,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:21:34,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:21:34,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:21:34,364 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:21:34,364 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:21:34,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 15:21:34,365 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 15:21:34,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:21:34,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:21:34,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:34,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:21:34,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:21:34,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:34,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:21:34,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:21:34,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:21:34,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... [2018-12-03 15:21:34,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:21:34,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:21:34,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:21:34,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:21:34,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:34,538 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:21:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:21:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:21:34,794 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:21:34,794 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:21:34,795 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:34 BoogieIcfgContainer [2018-12-03 15:21:34,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:21:34,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:21:34,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:21:34,800 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:21:34,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:34" (1/2) ... [2018-12-03 15:21:34,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c541a81 and model type gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:21:34, skipping insertion in model container [2018-12-03 15:21:34,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:34" (2/2) ... [2018-12-03 15:21:34,804 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 15:21:34,814 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:21:34,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:21:34,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:21:34,889 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:21:34,889 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:21:34,890 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:21:34,890 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:21:34,890 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:21:34,890 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:21:34,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:21:34,891 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:21:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-03 15:21:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:21:34,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:34,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:21:34,920 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:34,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash 30023, now seen corresponding path program 1 times [2018-12-03 15:21:34,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:34,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:34,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:34,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:34,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:35,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:35,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:21:35,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:35,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:21:35,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:21:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:35,103 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-03 15:21:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:35,202 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2018-12-03 15:21:35,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:21:35,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:21:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:35,215 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:21:35,215 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:21:35,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:21:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:21:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:21:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:21:35,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2018-12-03 15:21:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:35,252 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:21:35,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:21:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:21:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:21:35,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:35,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:21:35,254 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:35,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 28788909, now seen corresponding path program 1 times [2018-12-03 15:21:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:35,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:35,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:35,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:35,404 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 15:21:35,406 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [11], [15] [2018-12-03 15:21:35,484 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:35,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:35,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:35,713 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:21:35,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:35,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:35,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:35,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:35,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:35,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:35,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:35,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:35,904 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:21:35,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2018-12-03 15:21:35,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:35,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:21:35,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:21:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:35,907 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2018-12-03 15:21:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:35,943 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 15:21:35,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:21:35,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 15:21:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:35,944 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:21:35,944 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:21:35,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:21:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-03 15:21:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:21:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 15:21:35,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-12-03 15:21:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:35,952 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 15:21:35,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:21:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 15:21:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:21:35,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:35,953 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 15:21:35,954 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:35,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1896276501, now seen corresponding path program 1 times [2018-12-03 15:21:35,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:35,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:35,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:35,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:35,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:36,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:36,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:36,011 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 15:21:36,011 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [11], [13], [15] [2018-12-03 15:21:36,013 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:36,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:36,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:36,145 INFO L272 AbstractInterpreter]: Visited 6 different actions 33 times. Merged at 5 different actions 18 times. Widened at 2 different actions 4 times. Found 7 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:21:36,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:36,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:36,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:36,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:36,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:36,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:36,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:36,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:36,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:21:36,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:36,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:36,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:36,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:36,293 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 15:21:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:36,366 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-03 15:21:36,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:36,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 15:21:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:36,368 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:21:36,369 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:21:36,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:21:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:21:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:21:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 15:21:36,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 7 [2018-12-03 15:21:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:36,376 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 15:21:36,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 15:21:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:21:36,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:36,377 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-12-03 15:21:36,378 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:36,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:36,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1253675643, now seen corresponding path program 2 times [2018-12-03 15:21:36,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:36,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:36,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:36,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:36,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:36,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:36,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:36,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:36,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:36,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:36,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:36,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:36,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:36,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:21:36,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:36,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:36,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:36,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2018-12-03 15:21:36,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:36,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:21:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:21:36,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:21:36,878 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-12-03 15:21:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:37,063 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-12-03 15:21:37,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:21:37,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 15:21:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:37,066 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:21:37,067 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:21:37,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:21:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:21:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-03 15:21:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:21:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-03 15:21:37,073 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2018-12-03 15:21:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:37,074 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-03 15:21:37,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:21:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-12-03 15:21:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:21:37,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:37,075 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-12-03 15:21:37,075 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:37,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:37,075 INFO L82 PathProgramCache]: Analyzing trace with hash -74661839, now seen corresponding path program 3 times [2018-12-03 15:21:37,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:37,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:37,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:37,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:37,186 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:37,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:37,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:37,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:37,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:37,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:37,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:37,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:37,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:37,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:37,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:37,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:21:37,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:37,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:21:37,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:21:37,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:37,326 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2018-12-03 15:21:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:37,385 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-03 15:21:37,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:21:37,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-03 15:21:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:37,389 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:21:37,389 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:21:37,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:21:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:21:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:21:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-03 15:21:37,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-12-03 15:21:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:37,395 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-03 15:21:37,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:21:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-03 15:21:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:21:37,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:37,396 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-12-03 15:21:37,397 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:37,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 584297111, now seen corresponding path program 4 times [2018-12-03 15:21:37,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:37,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:37,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:37,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:37,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:37,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:37,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:37,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:37,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:37,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:37,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:37,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:21:37,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:37,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:21:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:21:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:21:37,952 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 7 states. [2018-12-03 15:21:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:37,996 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-12-03 15:21:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:21:37,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 15:21:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:37,998 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:21:38,000 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:21:38,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:21:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:21:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:21:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:21:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-03 15:21:38,005 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-12-03 15:21:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:38,006 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-03 15:21:38,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:21:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-03 15:21:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:21:38,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:38,007 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-12-03 15:21:38,007 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:38,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1811311747, now seen corresponding path program 5 times [2018-12-03 15:21:38,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:38,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:38,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:38,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:38,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:38,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:38,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:38,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:38,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:38,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:38,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:21:38,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:38,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:21:38,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:21:38,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:38,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 15:21:38,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:38,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:21:38,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:21:38,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:38,331 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 12 states. [2018-12-03 15:21:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:38,477 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-12-03 15:21:38,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:21:38,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-03 15:21:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:38,479 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:21:38,480 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:21:38,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:21:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 15:21:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:21:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-03 15:21:38,485 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2018-12-03 15:21:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:38,486 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-03 15:21:38,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:21:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-03 15:21:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:21:38,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:38,487 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1] [2018-12-03 15:21:38,487 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:38,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:38,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1486667467, now seen corresponding path program 6 times [2018-12-03 15:21:38,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:38,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:38,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:38,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:38,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:21:38,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:38,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:38,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:38,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:38,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:38,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:38,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:38,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:38,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:38,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:38,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:21:38,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:21:38,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:38,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:21:38,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:38,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:21:38,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:21:38,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:38,922 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 9 states. [2018-12-03 15:21:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:39,076 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-12-03 15:21:39,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:21:39,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 15:21:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:39,077 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:21:39,077 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:21:39,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:21:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:21:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:21:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-03 15:21:39,083 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2018-12-03 15:21:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:39,084 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-03 15:21:39,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:21:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-03 15:21:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:21:39,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:39,085 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1] [2018-12-03 15:21:39,085 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:39,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2057167665, now seen corresponding path program 7 times [2018-12-03 15:21:39,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:39,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:39,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:39,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:21:39,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:39,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:39,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:39,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:39,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:39,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:39,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:21:39,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:21:39,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:39,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:21:39,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:39,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:21:39,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:21:39,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:21:39,700 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 10 states. [2018-12-03 15:21:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:39,749 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-12-03 15:21:39,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:21:39,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-03 15:21:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:39,751 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:21:39,751 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:21:39,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:21:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:21:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:21:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:21:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 15:21:39,757 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2018-12-03 15:21:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:39,757 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 15:21:39,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:21:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 15:21:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:21:39,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:39,758 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1] [2018-12-03 15:21:39,759 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:39,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 552044055, now seen corresponding path program 8 times [2018-12-03 15:21:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:39,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:39,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:39,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:39,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:21:39,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:39,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:39,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:39,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:39,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:39,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:39,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:21:39,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:39,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 15:21:39,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 15:21:40,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:40,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2018-12-03 15:21:40,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:40,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:21:40,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:21:40,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:21:40,103 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 16 states. [2018-12-03 15:21:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:40,428 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-03 15:21:40,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:21:40,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-03 15:21:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:40,429 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:21:40,430 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:21:40,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:21:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:21:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 15:21:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:21:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-03 15:21:40,436 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 27 [2018-12-03 15:21:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:40,436 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-03 15:21:40,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:21:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-03 15:21:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:21:40,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:40,438 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1] [2018-12-03 15:21:40,438 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:40,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash -697357083, now seen corresponding path program 9 times [2018-12-03 15:21:40,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:40,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:40,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:40,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:40,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:40,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:40,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:40,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:40,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:40,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:40,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:40,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:40,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:40,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:40,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:40,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:40,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:40,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:21:40,878 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:40,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:21:40,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:21:40,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:21:40,880 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 12 states. [2018-12-03 15:21:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:40,983 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-12-03 15:21:40,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:21:40,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 15:21:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:40,984 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:21:40,984 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:21:40,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:21:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:21:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:21:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:21:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 15:21:40,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2018-12-03 15:21:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:40,992 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 15:21:40,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:21:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 15:21:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:21:40,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:40,993 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1] [2018-12-03 15:21:40,995 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:40,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 441486155, now seen corresponding path program 10 times [2018-12-03 15:21:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:40,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:40,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:41,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:41,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:41,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:41,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:41,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:41,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:41,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:41,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:41,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:41,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:41,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:41,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:21:41,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:41,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:21:41,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:21:41,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:21:41,669 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 13 states. [2018-12-03 15:21:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:41,719 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-03 15:21:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:21:41,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 15:21:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:41,720 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:21:41,720 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:21:41,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:21:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:21:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:21:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:21:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-03 15:21:41,726 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2018-12-03 15:21:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:41,727 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-03 15:21:41,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:21:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-03 15:21:41,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:21:41,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:41,728 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1] [2018-12-03 15:21:41,728 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:41,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:41,729 INFO L82 PathProgramCache]: Analyzing trace with hash -346822607, now seen corresponding path program 11 times [2018-12-03 15:21:41,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:41,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:41,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:41,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 15:21:41,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:41,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:41,871 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:41,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:41,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:41,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:41,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:41,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:41,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:21:41,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:41,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:21:42,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:21:42,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:42,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2018-12-03 15:21:42,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:42,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:21:42,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:21:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:21:42,256 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 20 states. [2018-12-03 15:21:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:42,375 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-12-03 15:21:42,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:21:42,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-03 15:21:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:42,376 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:21:42,377 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:21:42,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:21:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:21:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-03 15:21:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:21:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-03 15:21:42,385 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 35 [2018-12-03 15:21:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:42,385 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-03 15:21:42,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:21:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-03 15:21:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:21:42,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:42,387 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1] [2018-12-03 15:21:42,387 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:42,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash 446179967, now seen corresponding path program 12 times [2018-12-03 15:21:42,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:42,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:42,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:42,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:42,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:42,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:42,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:42,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:42,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:42,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:42,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:42,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:42,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:42,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:42,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:42,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:42,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:43,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:43,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:21:43,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:43,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:21:43,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:21:43,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:21:43,279 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 15 states. [2018-12-03 15:21:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:43,367 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-12-03 15:21:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:21:43,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 15:21:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:43,369 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:21:43,370 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:21:43,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:21:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:21:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:21:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:21:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 15:21:43,377 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2018-12-03 15:21:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:43,378 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 15:21:43,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:21:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 15:21:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:21:43,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:43,379 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1] [2018-12-03 15:21:43,380 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:43,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:43,380 INFO L82 PathProgramCache]: Analyzing trace with hash 562021093, now seen corresponding path program 13 times [2018-12-03 15:21:43,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:43,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:43,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:43,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:43,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:43,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:43,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:43,634 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:43,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:43,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:43,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:43,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:43,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:43,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:43,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:44,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:44,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:21:44,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:44,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:21:44,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:21:44,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:21:44,554 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 16 states. [2018-12-03 15:21:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:44,644 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-03 15:21:44,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:21:44,645 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-03 15:21:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:44,646 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:21:44,646 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:21:44,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:21:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:21:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:21:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:21:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 15:21:44,653 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2018-12-03 15:21:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:44,653 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 15:21:44,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:21:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 15:21:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:21:44,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:44,655 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1] [2018-12-03 15:21:44,655 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:44,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:44,655 INFO L82 PathProgramCache]: Analyzing trace with hash 216193483, now seen corresponding path program 14 times [2018-12-03 15:21:44,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:44,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:44,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 15:21:44,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:44,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:44,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:44,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:44,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:44,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:44,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:44,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:45,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:21:45,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:45,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 15:21:45,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 15:21:45,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:45,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2018-12-03 15:21:45,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:45,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:21:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:21:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:21:45,872 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 24 states. [2018-12-03 15:21:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:45,979 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2018-12-03 15:21:45,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:21:45,980 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-12-03 15:21:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:45,981 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:21:45,981 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:21:45,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:21:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:21:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 15:21:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:21:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-03 15:21:45,989 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 43 [2018-12-03 15:21:45,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:45,989 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-03 15:21:45,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:21:45,989 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-03 15:21:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:21:45,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:45,990 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1] [2018-12-03 15:21:45,991 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:45,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash 606328729, now seen corresponding path program 15 times [2018-12-03 15:21:45,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:45,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:45,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:45,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:45,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:21:46,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:46,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:46,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:46,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:46,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:46,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:46,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:46,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:46,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:46,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:46,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:21:46,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:21:47,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:47,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:21:47,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:47,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:21:47,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:21:47,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:21:47,096 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 18 states. [2018-12-03 15:21:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:47,169 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-12-03 15:21:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:21:47,170 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-12-03 15:21:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:47,170 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:21:47,170 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:21:47,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:21:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:21:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:21:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:21:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 15:21:47,176 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 47 [2018-12-03 15:21:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:47,176 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 15:21:47,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:21:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 15:21:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:21:47,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:47,177 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1] [2018-12-03 15:21:47,177 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:47,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash 154642943, now seen corresponding path program 16 times [2018-12-03 15:21:47,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:47,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:47,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:21:47,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:47,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:47,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:47,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:47,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:47,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:47,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:47,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:47,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:21:47,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:21:48,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:21:48,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:48,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:21:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:21:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:21:48,469 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 19 states. [2018-12-03 15:21:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:48,538 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-12-03 15:21:48,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:21:48,539 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-03 15:21:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:48,540 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:21:48,541 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:21:48,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:21:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:21:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:21:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:21:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-03 15:21:48,548 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 49 [2018-12-03 15:21:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:48,548 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-03 15:21:48,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:21:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-03 15:21:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:21:48,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:48,550 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1] [2018-12-03 15:21:48,550 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:48,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash -123700507, now seen corresponding path program 17 times [2018-12-03 15:21:48,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:48,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:48,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:21:49,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:49,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:49,206 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:49,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:49,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:49,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:49,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:49,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:49,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:21:49,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:49,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 15:21:49,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 15:21:50,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 36 [2018-12-03 15:21:50,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:50,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:21:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:21:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:21:50,082 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 28 states. [2018-12-03 15:21:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:50,480 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-12-03 15:21:50,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:21:50,480 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 15:21:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:50,481 INFO L225 Difference]: With dead ends: 74 [2018-12-03 15:21:50,481 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:21:50,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:21:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:21:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-03 15:21:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:21:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-03 15:21:50,487 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 51 [2018-12-03 15:21:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:50,487 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-03 15:21:50,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:21:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-12-03 15:21:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:21:50,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:50,488 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1] [2018-12-03 15:21:50,488 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:50,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash -845786061, now seen corresponding path program 18 times [2018-12-03 15:21:50,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:50,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:50,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:50,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:21:50,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:50,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:50,904 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:50,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:50,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:50,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:50,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:50,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:50,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:50,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:50,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:21:50,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:21:52,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:52,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:21:52,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:52,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:21:52,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:21:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:21:52,338 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 21 states. [2018-12-03 15:21:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:52,465 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-12-03 15:21:52,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:21:52,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-12-03 15:21:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:52,466 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:21:52,466 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:21:52,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:21:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:21:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:21:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:21:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-03 15:21:52,474 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 55 [2018-12-03 15:21:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:52,475 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-03 15:21:52,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:21:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-03 15:21:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:21:52,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:52,476 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1] [2018-12-03 15:21:52,476 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:52,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 637296793, now seen corresponding path program 19 times [2018-12-03 15:21:52,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:52,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:52,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:52,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:21:52,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:52,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:52,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:52,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:52,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:52,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:52,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:52,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:52,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:21:52,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:21:53,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:53,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:21:53,409 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:53,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:21:53,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:21:53,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:21:53,410 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 22 states. [2018-12-03 15:21:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:53,551 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2018-12-03 15:21:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:21:53,552 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-03 15:21:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:53,553 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:21:53,553 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:21:53,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:21:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:21:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:21:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:21:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-03 15:21:53,560 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 57 [2018-12-03 15:21:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:53,560 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-03 15:21:53,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:21:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-03 15:21:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:21:53,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:53,562 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1] [2018-12-03 15:21:53,562 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:53,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:53,562 INFO L82 PathProgramCache]: Analyzing trace with hash -49222785, now seen corresponding path program 20 times [2018-12-03 15:21:53,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:53,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:53,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:53,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:53,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:21:53,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:53,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:53,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:53,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:53,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:53,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:53,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:53,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:53,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:21:53,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:53,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 15:21:54,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 15:21:54,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:54,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 41 [2018-12-03 15:21:54,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:54,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:21:54,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:21:54,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:21:54,289 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 32 states. [2018-12-03 15:21:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:54,447 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-12-03 15:21:54,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:21:54,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-03 15:21:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:54,452 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:21:54,452 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:21:54,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:21:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:21:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-03 15:21:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:21:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-12-03 15:21:54,458 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 59 [2018-12-03 15:21:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:54,458 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-12-03 15:21:54,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:21:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-12-03 15:21:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:21:54,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:54,459 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1] [2018-12-03 15:21:54,460 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:54,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash -823410611, now seen corresponding path program 21 times [2018-12-03 15:21:54,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:54,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:54,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:54,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:55,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:55,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:55,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:55,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:55,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:55,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:55,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:55,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:55,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:55,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:55,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:55,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:21:55,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:55,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:21:55,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:21:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:21:55,681 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 24 states. [2018-12-03 15:21:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:55,766 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-03 15:21:55,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:21:55,767 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-12-03 15:21:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:55,767 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:21:55,768 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:21:55,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:21:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:21:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 15:21:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:21:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 15:21:55,774 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 63 [2018-12-03 15:21:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:55,774 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 15:21:55,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:21:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 15:21:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:21:55,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:55,775 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1] [2018-12-03 15:21:55,776 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:55,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1446377805, now seen corresponding path program 22 times [2018-12-03 15:21:55,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:55,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:55,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:56,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:56,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:56,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:56,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:56,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:56,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:56,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:57,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:57,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:21:57,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:57,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:21:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:21:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:21:57,880 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 25 states. [2018-12-03 15:21:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:57,964 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2018-12-03 15:21:57,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:21:57,964 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-12-03 15:21:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:57,965 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:21:57,965 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:21:57,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:21:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:21:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:21:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:21:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-03 15:21:57,971 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 65 [2018-12-03 15:21:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:57,971 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-03 15:21:57,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:21:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-03 15:21:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:21:57,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,972 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1] [2018-12-03 15:21:57,973 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1177570201, now seen corresponding path program 23 times [2018-12-03 15:21:57,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 15:21:58,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:58,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:58,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:58,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:58,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:58,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:21:58,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:58,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 15:21:58,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 15:21:58,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:58,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2018-12-03 15:21:58,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:58,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:21:58,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:21:58,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:21:58,909 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 36 states. [2018-12-03 15:21:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:59,203 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2018-12-03 15:21:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:21:59,203 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-03 15:21:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:59,204 INFO L225 Difference]: With dead ends: 94 [2018-12-03 15:21:59,205 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:21:59,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:21:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:21:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 15:21:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:21:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-12-03 15:21:59,211 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 67 [2018-12-03 15:21:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:59,211 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-12-03 15:21:59,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:21:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-12-03 15:21:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:21:59,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:59,212 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1] [2018-12-03 15:21:59,212 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:59,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1066941415, now seen corresponding path program 24 times [2018-12-03 15:21:59,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:21:59,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:59,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:59,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:59,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:59,550 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:59,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:59,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:59,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:59,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:21:59,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:22:00,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:22:00,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:22:00,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:22:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:00,578 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 27 states. [2018-12-03 15:22:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,678 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2018-12-03 15:22:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:22:00,679 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 15:22:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,679 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:22:00,679 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:22:00,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:22:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:22:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:22:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-03 15:22:00,685 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 71 [2018-12-03 15:22:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,686 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-03 15:22:00,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:22:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-03 15:22:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:22:00,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,686 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1] [2018-12-03 15:22:00,686 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 638893133, now seen corresponding path program 25 times [2018-12-03 15:22:00,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:22:01,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:01,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:01,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:01,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:01,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:22:01,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:22:02,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:02,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 15:22:02,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:02,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:22:02,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:22:02,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:02,368 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 28 states. [2018-12-03 15:22:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:02,808 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2018-12-03 15:22:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:22:02,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-12-03 15:22:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:02,810 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:22:02,810 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:22:02,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:22:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:22:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:22:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-03 15:22:02,815 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 73 [2018-12-03 15:22:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:02,815 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-03 15:22:02,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:22:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-03 15:22:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:22:02,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:02,816 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1] [2018-12-03 15:22:02,817 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:02,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:02,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1601354547, now seen corresponding path program 26 times [2018-12-03 15:22:02,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 15:22:03,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:03,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:03,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:03,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:03,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:03,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:03,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:22:03,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:03,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 15:22:03,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 15:22:03,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:03,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 13] total 51 [2018-12-03 15:22:03,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:03,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:22:03,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:22:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:22:03,809 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 40 states. [2018-12-03 15:22:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:04,001 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-12-03 15:22:04,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:22:04,001 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-12-03 15:22:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:04,002 INFO L225 Difference]: With dead ends: 104 [2018-12-03 15:22:04,002 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 15:22:04,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:22:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 15:22:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-03 15:22:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:22:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-12-03 15:22:04,007 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 75 [2018-12-03 15:22:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:04,008 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-12-03 15:22:04,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:22:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-12-03 15:22:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:22:04,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:04,008 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1] [2018-12-03 15:22:04,009 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:04,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1735923967, now seen corresponding path program 27 times [2018-12-03 15:22:04,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:22:04,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:04,675 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:04,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:04,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:04,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:04,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:04,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:04,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:04,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:22:04,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:22:05,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:05,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 15:22:05,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:05,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:22:05,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:22:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:05,837 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 30 states. [2018-12-03 15:22:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,920 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-12-03 15:22:05,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:22:05,920 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-12-03 15:22:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,921 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:22:05,921 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:22:05,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:22:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:22:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:22:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-03 15:22:05,928 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 79 [2018-12-03 15:22:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,928 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-03 15:22:05,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:22:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-03 15:22:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:22:05,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,929 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1] [2018-12-03 15:22:05,929 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1916231321, now seen corresponding path program 28 times [2018-12-03 15:22:05,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:05,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:22:06,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:06,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:06,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:06,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:06,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:06,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:06,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:22:06,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:22:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:07,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 15:22:07,928 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:07,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:22:07,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:22:07,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:07,930 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 31 states. [2018-12-03 15:22:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:08,038 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2018-12-03 15:22:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:22:08,039 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-12-03 15:22:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:08,040 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:22:08,040 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 15:22:08,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 15:22:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 15:22:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:22:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-12-03 15:22:08,047 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 81 [2018-12-03 15:22:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:08,048 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-12-03 15:22:08,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:22:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-12-03 15:22:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:22:08,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:08,049 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1] [2018-12-03 15:22:08,049 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:08,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 902060621, now seen corresponding path program 29 times [2018-12-03 15:22:08,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:08,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:08,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 15:22:08,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:08,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:08,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:08,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:08,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:08,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:08,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:08,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:22:08,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:08,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 15:22:08,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 15:22:09,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14, 14] total 56 [2018-12-03 15:22:09,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:09,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:22:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:22:09,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:22:09,324 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 44 states. [2018-12-03 15:22:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:09,508 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2018-12-03 15:22:09,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:22:09,508 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2018-12-03 15:22:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:09,509 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:22:09,509 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 15:22:09,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:22:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 15:22:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-03 15:22:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:22:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-12-03 15:22:09,515 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 83 [2018-12-03 15:22:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:09,515 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-12-03 15:22:09,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:22:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-12-03 15:22:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:22:09,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:09,516 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1] [2018-12-03 15:22:09,516 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:09,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash 907993499, now seen corresponding path program 30 times [2018-12-03 15:22:09,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:09,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:09,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:22:10,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:10,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:10,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:10,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:10,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:10,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:10,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:10,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:10,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:10,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:10,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:22:10,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:22:11,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:11,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 15:22:11,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:11,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:22:11,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:22:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:11,185 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 33 states. [2018-12-03 15:22:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:11,360 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2018-12-03 15:22:11,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:22:11,361 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-12-03 15:22:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:11,362 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:22:11,362 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 15:22:11,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 15:22:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 15:22:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:22:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-12-03 15:22:11,368 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 87 [2018-12-03 15:22:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:11,368 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-12-03 15:22:11,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:22:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-12-03 15:22:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:22:11,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:11,369 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1] [2018-12-03 15:22:11,369 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:11,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1219897855, now seen corresponding path program 31 times [2018-12-03 15:22:11,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:11,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:11,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:11,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:22:12,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:12,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:12,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:12,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:12,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:12,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:12,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:12,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:12,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:22:12,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:22:12,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:12,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 15:22:12,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:12,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:22:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:22:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:12,971 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 34 states. [2018-12-03 15:22:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,098 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-12-03 15:22:13,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:22:13,099 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-12-03 15:22:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,100 INFO L225 Difference]: With dead ends: 119 [2018-12-03 15:22:13,100 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:22:13,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:22:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 15:22:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 15:22:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-12-03 15:22:13,106 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 89 [2018-12-03 15:22:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,106 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-12-03 15:22:13,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:22:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-12-03 15:22:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 15:22:13,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,107 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1] [2018-12-03 15:22:13,107 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:13,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1719056153, now seen corresponding path program 32 times [2018-12-03 15:22:13,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 15:22:13,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:13,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:13,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:13,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:13,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:13,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:13,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:13,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:13,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:22:13,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:13,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 15:22:14,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 15:22:15,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:15,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 15] total 61 [2018-12-03 15:22:15,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:15,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:22:15,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:22:15,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:22:15,532 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 48 states. [2018-12-03 15:22:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:15,750 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-12-03 15:22:15,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:22:15,750 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-12-03 15:22:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:15,751 INFO L225 Difference]: With dead ends: 124 [2018-12-03 15:22:15,751 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:22:15,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:22:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:22:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 15:22:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:22:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-12-03 15:22:15,758 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 91 [2018-12-03 15:22:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:15,758 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-12-03 15:22:15,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:22:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-12-03 15:22:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:22:15,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:15,759 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1] [2018-12-03 15:22:15,759 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:15,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1513704373, now seen corresponding path program 33 times [2018-12-03 15:22:15,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:15,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:15,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:15,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:15,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:22:16,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:16,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:16,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:16,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:16,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:16,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:16,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:16,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:16,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:16,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:16,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:22:16,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:22:17,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:17,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 15:22:17,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:17,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:22:17,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:22:17,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:17,227 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 36 states. [2018-12-03 15:22:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:17,343 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2018-12-03 15:22:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:22:17,344 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2018-12-03 15:22:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:17,345 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:22:17,345 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:22:17,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 155 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:22:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 15:22:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:22:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-12-03 15:22:17,351 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 95 [2018-12-03 15:22:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:17,352 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-12-03 15:22:17,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:22:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-12-03 15:22:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 15:22:17,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:17,353 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1] [2018-12-03 15:22:17,353 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:17,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:17,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1584691739, now seen corresponding path program 34 times [2018-12-03 15:22:17,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:17,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:17,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:17,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:17,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:22:18,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:18,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:18,055 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:18,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:18,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:18,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:18,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:18,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:22:18,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:22:18,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:18,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 15:22:18,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:18,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:22:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:22:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:18,969 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 37 states. [2018-12-03 15:22:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:19,112 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2018-12-03 15:22:19,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:22:19,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-12-03 15:22:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:19,114 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:22:19,114 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:22:19,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:22:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:22:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:22:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-12-03 15:22:19,121 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 97 [2018-12-03 15:22:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:19,121 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-12-03 15:22:19,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:22:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-12-03 15:22:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:22:19,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:19,122 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1] [2018-12-03 15:22:19,122 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:19,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1084073729, now seen corresponding path program 35 times [2018-12-03 15:22:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:19,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:19,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 15:22:19,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:19,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:19,777 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:19,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:19,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:19,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:19,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:19,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:19,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:22:19,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:19,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 15:22:20,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 15:22:21,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:21,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16, 16] total 66 [2018-12-03 15:22:21,161 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:21,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:22:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:22:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:22:21,163 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 52 states. [2018-12-03 15:22:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:21,433 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-12-03 15:22:21,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:22:21,433 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2018-12-03 15:22:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:21,434 INFO L225 Difference]: With dead ends: 134 [2018-12-03 15:22:21,435 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 15:22:21,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:22:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 15:22:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-03 15:22:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 15:22:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-12-03 15:22:21,441 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 99 [2018-12-03 15:22:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:21,441 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-12-03 15:22:21,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:22:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-12-03 15:22:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 15:22:21,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:21,442 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1] [2018-12-03 15:22:21,443 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:21,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:21,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1372895921, now seen corresponding path program 36 times [2018-12-03 15:22:21,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:21,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:21,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:21,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:21,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:22:22,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:22,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:22,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:22,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:22,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:22,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:22,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:22,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:22,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:22,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:22,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:22:22,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:22:23,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:23,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 51 [2018-12-03 15:22:23,224 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:23,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:22:23,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:22:23,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:23,226 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 39 states. [2018-12-03 15:22:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:23,431 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2018-12-03 15:22:23,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:22:23,431 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-12-03 15:22:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:23,432 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:22:23,433 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:22:23,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:22:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 15:22:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:22:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 15:22:23,440 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 103 [2018-12-03 15:22:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:23,441 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 15:22:23,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:22:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 15:22:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:22:23,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:23,442 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1] [2018-12-03 15:22:23,442 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:23,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1499681355, now seen corresponding path program 37 times [2018-12-03 15:22:23,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:23,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:23,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:22:24,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:24,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:24,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:24,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:24,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:24,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:24,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:24,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:24,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:22:24,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:22:25,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:25,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 15:22:25,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:25,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:22:25,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:22:25,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:25,164 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 40 states. [2018-12-03 15:22:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:25,395 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2018-12-03 15:22:25,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:22:25,395 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 15:22:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:25,396 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:22:25,396 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:22:25,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 171 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:22:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 15:22:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:22:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-12-03 15:22:25,403 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 105 [2018-12-03 15:22:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:25,403 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-12-03 15:22:25,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:22:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-12-03 15:22:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:22:25,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:25,404 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1] [2018-12-03 15:22:25,404 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:25,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1213568155, now seen corresponding path program 38 times [2018-12-03 15:22:25,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:25,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:25,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 15:22:26,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:26,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:26,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:26,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:26,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:26,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:26,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:26,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:22:26,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:26,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 15:22:26,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 15:22:27,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:27,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 17, 17] total 71 [2018-12-03 15:22:27,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:27,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:22:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:22:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:22:27,575 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 56 states. [2018-12-03 15:22:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:27,857 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2018-12-03 15:22:27,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:22:27,857 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2018-12-03 15:22:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:27,858 INFO L225 Difference]: With dead ends: 144 [2018-12-03 15:22:27,858 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 15:22:27,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:22:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 15:22:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-03 15:22:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:22:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-12-03 15:22:27,864 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 107 [2018-12-03 15:22:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:27,864 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-12-03 15:22:27,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:22:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-12-03 15:22:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:22:27,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:27,865 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1] [2018-12-03 15:22:27,866 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:27,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1153494633, now seen corresponding path program 39 times [2018-12-03 15:22:27,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:27,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:27,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:22:28,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:28,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:28,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:28,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:28,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:28,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:28,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:28,677 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:28,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:28,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:28,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:22:28,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:22:31,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:31,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 51 [2018-12-03 15:22:31,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:31,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:22:31,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:22:31,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:31,236 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 42 states. [2018-12-03 15:22:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:32,478 INFO L93 Difference]: Finished difference Result 147 states and 178 transitions. [2018-12-03 15:22:32,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:22:32,478 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 15:22:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:32,479 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:22:32,480 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 15:22:32,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 15:22:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 15:22:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:22:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-12-03 15:22:32,485 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 111 [2018-12-03 15:22:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:32,486 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-12-03 15:22:32,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:22:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-12-03 15:22:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:22:32,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:32,486 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1] [2018-12-03 15:22:32,487 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:32,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 479105231, now seen corresponding path program 40 times [2018-12-03 15:22:32,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:32,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:32,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:32,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:32,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:22:33,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:33,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:33,237 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:33,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:33,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:33,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:33,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:33,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:33,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:22:33,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:22:34,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:34,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 15:22:34,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:34,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:22:34,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:22:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:34,276 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 43 states. [2018-12-03 15:22:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:34,432 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2018-12-03 15:22:34,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:22:34,433 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-12-03 15:22:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:34,434 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:22:34,434 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 15:22:34,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 184 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 15:22:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 15:22:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 15:22:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-12-03 15:22:34,441 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 113 [2018-12-03 15:22:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:34,441 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-12-03 15:22:34,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:22:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-12-03 15:22:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 15:22:34,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:34,442 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1] [2018-12-03 15:22:34,442 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:34,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash 930951605, now seen corresponding path program 41 times [2018-12-03 15:22:34,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:34,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:34,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 15:22:35,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:35,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:35,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:35,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:35,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:35,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:35,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:35,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:35,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:22:35,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:35,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 15:22:36,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 15:22:37,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:37,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 18, 18] total 76 [2018-12-03 15:22:37,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:37,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:22:37,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:22:37,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:22:37,032 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 60 states. [2018-12-03 15:22:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:37,321 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-12-03 15:22:37,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:22:37,321 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2018-12-03 15:22:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:37,323 INFO L225 Difference]: With dead ends: 154 [2018-12-03 15:22:37,323 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:22:37,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:22:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:22:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 15:22:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:22:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-12-03 15:22:37,330 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 115 [2018-12-03 15:22:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:37,330 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-12-03 15:22:37,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:22:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-12-03 15:22:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:22:37,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:37,332 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1] [2018-12-03 15:22:37,332 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:37,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 473851651, now seen corresponding path program 42 times [2018-12-03 15:22:37,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:37,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:37,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:22:38,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:38,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:38,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:38,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:38,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:38,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:38,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:38,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:38,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:38,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:38,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:22:38,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:22:39,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:39,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 51 [2018-12-03 15:22:39,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:39,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:22:39,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:22:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:39,334 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 45 states. [2018-12-03 15:22:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:39,494 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2018-12-03 15:22:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:22:39,494 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-12-03 15:22:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:39,496 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:22:39,496 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 15:22:39,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 194 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 15:22:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 15:22:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 15:22:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 15:22:39,502 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 119 [2018-12-03 15:22:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:39,503 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 15:22:39,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:22:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 15:22:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 15:22:39,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:39,503 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1] [2018-12-03 15:22:39,503 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:39,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:39,504 INFO L82 PathProgramCache]: Analyzing trace with hash 948847465, now seen corresponding path program 43 times [2018-12-03 15:22:39,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:39,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:39,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:39,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:39,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:22:40,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:40,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:40,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:40,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:40,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:40,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:40,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:40,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:40,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:22:40,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:22:41,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:41,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 15:22:41,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:41,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:22:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:22:41,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:41,978 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 46 states. [2018-12-03 15:22:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:42,226 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2018-12-03 15:22:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:22:42,226 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-12-03 15:22:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:42,227 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:22:42,228 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:22:42,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 197 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:42,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:22:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:22:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:22:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 15:22:42,235 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 121 [2018-12-03 15:22:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:42,235 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 15:22:42,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:22:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 15:22:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:22:42,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:42,236 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1] [2018-12-03 15:22:42,237 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:42,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2141675953, now seen corresponding path program 44 times [2018-12-03 15:22:42,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:42,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:42,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 15:22:43,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:43,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:43,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:43,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:43,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:43,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:43,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:43,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:43,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:22:43,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:43,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 15:22:44,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 15:22:45,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:45,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 19] total 81 [2018-12-03 15:22:45,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:45,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:22:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:22:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:22:45,350 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 64 states. [2018-12-03 15:22:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:45,828 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2018-12-03 15:22:45,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:22:45,828 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2018-12-03 15:22:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:45,829 INFO L225 Difference]: With dead ends: 164 [2018-12-03 15:22:45,829 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 15:22:45,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:22:45,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 15:22:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-03 15:22:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 15:22:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2018-12-03 15:22:45,834 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 123 [2018-12-03 15:22:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:45,835 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-12-03 15:22:45,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:22:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2018-12-03 15:22:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 15:22:45,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:45,836 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1] [2018-12-03 15:22:45,836 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:45,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 543149853, now seen corresponding path program 45 times [2018-12-03 15:22:45,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:45,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:45,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:45,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:45,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:22:46,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:46,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:46,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:46,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:46,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:46,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:46,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:46,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:46,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:46,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:46,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:22:46,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:22:47,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:47,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 15:22:47,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:47,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:22:47,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:22:47,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:47,842 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand 48 states. [2018-12-03 15:22:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:48,017 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2018-12-03 15:22:48,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:22:48,017 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-12-03 15:22:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:48,019 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:22:48,019 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:22:48,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 207 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:22:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 15:22:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:22:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-03 15:22:48,026 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 127 [2018-12-03 15:22:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:48,026 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-03 15:22:48,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:22:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-03 15:22:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:22:48,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:48,027 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1] [2018-12-03 15:22:48,027 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:48,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:48,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1616373123, now seen corresponding path program 46 times [2018-12-03 15:22:48,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:48,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:48,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:48,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:22:49,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:49,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:49,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:49,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:49,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:49,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:49,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:49,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:49,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:22:49,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:22:50,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:50,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 15:22:50,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:50,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:22:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:22:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:50,050 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 49 states. [2018-12-03 15:22:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:50,274 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-12-03 15:22:50,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:22:50,275 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-12-03 15:22:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:50,276 INFO L225 Difference]: With dead ends: 169 [2018-12-03 15:22:50,276 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 15:22:50,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 15:22:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 15:22:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:22:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-12-03 15:22:50,284 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 129 [2018-12-03 15:22:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:50,284 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-12-03 15:22:50,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:22:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-12-03 15:22:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 15:22:50,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:50,285 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1] [2018-12-03 15:22:50,286 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:50,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:50,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2103182743, now seen corresponding path program 47 times [2018-12-03 15:22:50,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:50,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:50,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:50,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:50,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 15:22:51,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:51,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:51,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:51,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:51,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:51,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:51,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:51,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:22:51,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:51,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 15:22:52,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 15:22:53,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:53,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 20, 20] total 86 [2018-12-03 15:22:53,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:53,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:22:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:22:53,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:22:53,762 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 68 states. [2018-12-03 15:22:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:54,184 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-12-03 15:22:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:22:54,185 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2018-12-03 15:22:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:54,186 INFO L225 Difference]: With dead ends: 174 [2018-12-03 15:22:54,186 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 15:22:54,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:22:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 15:22:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-03 15:22:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:22:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2018-12-03 15:22:54,195 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 131 [2018-12-03 15:22:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:54,195 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2018-12-03 15:22:54,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:22:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2018-12-03 15:22:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:22:54,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:54,196 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1] [2018-12-03 15:22:54,197 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:54,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:54,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1403435337, now seen corresponding path program 48 times [2018-12-03 15:22:54,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:54,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:54,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:54,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:54,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:22:55,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:55,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:55,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:55,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:55,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:55,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:55,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:55,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:55,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:55,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:55,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:22:55,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:22:56,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:56,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 15:22:56,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:56,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:22:56,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:22:56,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:56,436 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand 51 states. [2018-12-03 15:22:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:57,783 INFO L93 Difference]: Finished difference Result 177 states and 214 transitions. [2018-12-03 15:22:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:22:57,784 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 135 [2018-12-03 15:22:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:57,785 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:22:57,785 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 15:22:57,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 15:22:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 15:22:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 15:22:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-03 15:22:57,792 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 135 [2018-12-03 15:22:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:57,792 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-03 15:22:57,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:22:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-03 15:22:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 15:22:57,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:57,793 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1] [2018-12-03 15:22:57,793 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:57,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1763677981, now seen corresponding path program 49 times [2018-12-03 15:22:57,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:57,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:57,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:22:59,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:59,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:59,028 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:59,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:59,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:59,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:59,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:59,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:59,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:22:59,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 15:23:01,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:01,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 15:23:01,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:01,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:23:01,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:23:01,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:01,371 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 52 states. [2018-12-03 15:23:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:01,600 INFO L93 Difference]: Finished difference Result 179 states and 216 transitions. [2018-12-03 15:23:01,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:23:01,600 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 137 [2018-12-03 15:23:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:01,602 INFO L225 Difference]: With dead ends: 179 [2018-12-03 15:23:01,602 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 15:23:01,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 15:23:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 15:23:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 15:23:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-12-03 15:23:01,608 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 137 [2018-12-03 15:23:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:01,609 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-12-03 15:23:01,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:23:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-12-03 15:23:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 15:23:01,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:01,610 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1] [2018-12-03 15:23:01,610 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:01,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash 227763715, now seen corresponding path program 50 times [2018-12-03 15:23:01,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:01,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:01,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:02,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:02,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:02,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:02,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:02,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:02,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:02,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:02,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:02,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:23:02,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:02,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:02,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:03,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:03,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-03 15:23:03,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:03,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:23:03,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:23:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:23:03,303 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 23 states. [2018-12-03 15:23:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:03,394 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-03 15:23:03,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:23:03,395 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2018-12-03 15:23:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:03,396 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:23:03,396 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 15:23:03,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:23:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 15:23:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-12-03 15:23:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 15:23:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-12-03 15:23:03,404 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 139 [2018-12-03 15:23:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:03,405 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-12-03 15:23:03,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:23:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2018-12-03 15:23:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 15:23:03,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:03,406 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1] [2018-12-03 15:23:03,407 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:03,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2102700987, now seen corresponding path program 51 times [2018-12-03 15:23:03,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:03,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:03,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:03,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:03,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:04,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:04,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:04,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:04,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:04,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:04,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:04,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:04,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:04,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:04,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:04,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:05,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:08,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:08,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 73, 73] total 102 [2018-12-03 15:23:08,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:08,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:23:08,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:23:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:08,206 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 76 states. [2018-12-03 15:23:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:08,593 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2018-12-03 15:23:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:23:08,594 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-12-03 15:23:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:08,595 INFO L225 Difference]: With dead ends: 155 [2018-12-03 15:23:08,595 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 15:23:08,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 15:23:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-12-03 15:23:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 15:23:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2018-12-03 15:23:08,600 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 145 [2018-12-03 15:23:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:08,600 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2018-12-03 15:23:08,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:23:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2018-12-03 15:23:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 15:23:08,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:08,605 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1] [2018-12-03 15:23:08,605 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:08,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1808320371, now seen corresponding path program 52 times [2018-12-03 15:23:08,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:08,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:08,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:10,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:10,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:10,104 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:10,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:10,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:10,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:10,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:10,114 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:10,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:11,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:13,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:13,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 76, 76] total 102 [2018-12-03 15:23:13,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:13,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:23:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:23:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:13,284 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 79 states. [2018-12-03 15:23:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:13,754 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2018-12-03 15:23:13,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:23:13,754 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-03 15:23:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:13,756 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:23:13,756 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 15:23:13,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 177 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 15:23:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-12-03 15:23:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 15:23:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2018-12-03 15:23:13,761 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 151 [2018-12-03 15:23:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:13,761 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2018-12-03 15:23:13,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:23:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2018-12-03 15:23:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 15:23:13,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:13,762 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1] [2018-12-03 15:23:13,762 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:13,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash 16202027, now seen corresponding path program 53 times [2018-12-03 15:23:13,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:13,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:13,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:14,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:14,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:14,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:14,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:14,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:14,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:14,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:14,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:14,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:23:14,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:14,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:14,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:15,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:15,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-03 15:23:15,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:15,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:23:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:23:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:15,534 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand 32 states. [2018-12-03 15:23:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:15,817 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2018-12-03 15:23:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:23:15,818 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-12-03 15:23:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:15,819 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:23:15,819 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 15:23:15,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 15:23:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-12-03 15:23:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 15:23:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2018-12-03 15:23:15,826 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 157 [2018-12-03 15:23:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:15,826 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2018-12-03 15:23:15,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:23:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2018-12-03 15:23:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 15:23:15,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:15,827 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1] [2018-12-03 15:23:15,827 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:15,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash 558334179, now seen corresponding path program 54 times [2018-12-03 15:23:15,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:15,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:15,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:15,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:15,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:17,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:17,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:17,145 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:17,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:17,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:17,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:17,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:17,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:17,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:17,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:17,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:18,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:20,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:20,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 82, 82] total 102 [2018-12-03 15:23:20,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:20,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:23:20,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:23:20,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:20,084 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 85 states. [2018-12-03 15:23:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:20,666 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2018-12-03 15:23:20,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:23:20,667 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-12-03 15:23:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:20,668 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:23:20,668 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 15:23:20,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 195 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 15:23:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-12-03 15:23:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 15:23:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2018-12-03 15:23:20,674 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 163 [2018-12-03 15:23:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:20,675 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2018-12-03 15:23:20,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:23:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2018-12-03 15:23:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 15:23:20,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:20,676 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1] [2018-12-03 15:23:20,676 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:20,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:20,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1518264677, now seen corresponding path program 55 times [2018-12-03 15:23:20,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:20,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:20,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:20,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:21,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:21,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:21,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:21,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:21,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:21,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:21,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:21,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:22,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:24,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:24,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 85, 85] total 102 [2018-12-03 15:23:24,618 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:24,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:23:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:23:24,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:24,620 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand 88 states. [2018-12-03 15:23:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:25,334 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2018-12-03 15:23:25,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:23:25,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-12-03 15:23:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:25,335 INFO L225 Difference]: With dead ends: 179 [2018-12-03 15:23:25,336 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 15:23:25,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 204 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 15:23:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-12-03 15:23:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 15:23:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2018-12-03 15:23:25,342 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 169 [2018-12-03 15:23:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:25,342 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2018-12-03 15:23:25,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:23:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2018-12-03 15:23:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 15:23:25,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:25,343 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1] [2018-12-03 15:23:25,344 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:25,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1832152493, now seen corresponding path program 56 times [2018-12-03 15:23:25,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:25,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:25,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:25,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:26,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:26,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:26,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:26,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:26,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:26,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:26,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:26,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:26,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 15:23:26,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:26,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:26,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:27,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:27,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-03 15:23:27,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:27,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:23:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:23:27,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:27,459 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand 41 states. [2018-12-03 15:23:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:27,661 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2018-12-03 15:23:27,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:23:27,662 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-12-03 15:23:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:27,663 INFO L225 Difference]: With dead ends: 185 [2018-12-03 15:23:27,663 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 15:23:27,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 15:23:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-12-03 15:23:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 15:23:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2018-12-03 15:23:27,671 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 175 [2018-12-03 15:23:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:27,671 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2018-12-03 15:23:27,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:23:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2018-12-03 15:23:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 15:23:27,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:27,672 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1] [2018-12-03 15:23:27,673 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:27,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1387158539, now seen corresponding path program 57 times [2018-12-03 15:23:27,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:27,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:27,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:28,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:28,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:28,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:28,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:28,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:28,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:28,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:28,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:28,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:28,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:28,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:29,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:31,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:31,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 91, 91] total 102 [2018-12-03 15:23:31,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:31,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:23:31,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:23:31,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:31,435 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand 94 states. [2018-12-03 15:23:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:32,175 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2018-12-03 15:23:32,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:23:32,176 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-12-03 15:23:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:32,177 INFO L225 Difference]: With dead ends: 191 [2018-12-03 15:23:32,177 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 15:23:32,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 222 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 15:23:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-12-03 15:23:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 15:23:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2018-12-03 15:23:32,182 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 181 [2018-12-03 15:23:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:32,182 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2018-12-03 15:23:32,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:23:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2018-12-03 15:23:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 15:23:32,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:32,184 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1] [2018-12-03 15:23:32,184 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:32,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:32,184 INFO L82 PathProgramCache]: Analyzing trace with hash -351208509, now seen corresponding path program 58 times [2018-12-03 15:23:32,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:32,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:32,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:33,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:33,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:33,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:33,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:33,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:33,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:33,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:33,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:33,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:34,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:36,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:36,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 94, 94] total 102 [2018-12-03 15:23:36,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:36,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 15:23:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 15:23:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:36,370 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 97 states. [2018-12-03 15:23:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:37,197 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2018-12-03 15:23:37,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:23:37,197 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-12-03 15:23:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:37,199 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:23:37,199 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 15:23:37,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 231 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 15:23:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-12-03 15:23:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 15:23:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2018-12-03 15:23:37,208 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 187 [2018-12-03 15:23:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:37,208 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2018-12-03 15:23:37,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 15:23:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-12-03 15:23:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 15:23:37,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:37,209 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1] [2018-12-03 15:23:37,210 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:37,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 909832571, now seen corresponding path program 59 times [2018-12-03 15:23:37,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:37,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:37,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 15:23:38,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:38,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:38,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:38,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:38,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:38,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:38,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:38,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:38,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-03 15:23:38,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:38,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:38,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:39,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:39,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-03 15:23:39,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:39,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:23:39,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:23:39,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:39,548 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand 50 states. [2018-12-03 15:23:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:39,849 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2018-12-03 15:23:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:23:39,850 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-12-03 15:23:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:39,851 INFO L225 Difference]: With dead ends: 203 [2018-12-03 15:23:39,851 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 15:23:39,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 340 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 15:23:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-12-03 15:23:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 15:23:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2018-12-03 15:23:39,858 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 193 [2018-12-03 15:23:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:39,859 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2018-12-03 15:23:39,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:23:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2018-12-03 15:23:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 15:23:39,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:39,860 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1] [2018-12-03 15:23:39,861 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:39,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:39,861 INFO L82 PathProgramCache]: Analyzing trace with hash 450084147, now seen corresponding path program 60 times [2018-12-03 15:23:39,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:39,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:39,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:39,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:39,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:40,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:40,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:40,848 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:40,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:40,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:40,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:40,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:40,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:40,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:40,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:40,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:42,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:44,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:44,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 100, 100] total 102 [2018-12-03 15:23:44,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:44,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:23:44,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:23:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:44,235 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand 101 states. [2018-12-03 15:23:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:45,232 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2018-12-03 15:23:45,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:23:45,233 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-12-03 15:23:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:45,234 INFO L225 Difference]: With dead ends: 205 [2018-12-03 15:23:45,234 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 15:23:45,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 249 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 15:23:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-03 15:23:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 15:23:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2018-12-03 15:23:45,242 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 199 [2018-12-03 15:23:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:45,242 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2018-12-03 15:23:45,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:23:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2018-12-03 15:23:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 15:23:45,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:45,244 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-12-03 15:23:45,244 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:45,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:45,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1260892901, now seen corresponding path program 61 times [2018-12-03 15:23:45,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:45,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:45,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:45,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:45,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 15:23:46,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:46,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:46,306 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:46,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:46,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:46,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:46,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:46,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:46,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:47,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:49,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:49,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 101, 101] total 102 [2018-12-03 15:23:49,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:49,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:23:49,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:23:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:49,965 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand 102 states. [2018-12-03 15:23:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:50,858 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2018-12-03 15:23:50,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:23:50,858 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-12-03 15:23:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:50,860 INFO L225 Difference]: With dead ends: 206 [2018-12-03 15:23:50,860 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 15:23:50,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 252 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 15:23:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-12-03 15:23:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 15:23:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2018-12-03 15:23:50,868 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 201 [2018-12-03 15:23:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:50,868 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2018-12-03 15:23:50,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:23:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2018-12-03 15:23:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 15:23:50,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:50,869 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-12-03 15:23:50,869 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:50,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash -537361661, now seen corresponding path program 62 times [2018-12-03 15:23:50,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:50,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:50,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:50,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:50,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:23:53,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:53,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:53,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:53,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:53,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:53,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:53,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:53,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:53,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-12-03 15:23:53,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:53,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:23:54,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:23:54,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:54,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 15:23:54,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:54,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:23:54,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:23:54,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:23:54,764 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 53 states. [2018-12-03 15:23:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:56,808 INFO L93 Difference]: Finished difference Result 2857 states and 4232 transitions. [2018-12-03 15:23:56,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:23:56,808 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-12-03 15:23:56,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:56,819 INFO L225 Difference]: With dead ends: 2857 [2018-12-03 15:23:56,819 INFO L226 Difference]: Without dead ends: 2855 [2018-12-03 15:23:56,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 401 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:23:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-12-03 15:23:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 206. [2018-12-03 15:23:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 15:23:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2018-12-03 15:23:56,924 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 203 [2018-12-03 15:23:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:56,924 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2018-12-03 15:23:56,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:23:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2018-12-03 15:23:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 15:23:56,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:56,926 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1] [2018-12-03 15:23:56,926 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:56,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:56,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1008541973, now seen corresponding path program 63 times [2018-12-03 15:23:56,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:56,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:56,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:56,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:56,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 15:23:58,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:23:58,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 15:23:58,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:23:58,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:23:58,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:23:58,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:58,384 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand 52 states. [2018-12-03 15:23:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:58,860 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2018-12-03 15:23:58,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:23:58,860 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 205 [2018-12-03 15:23:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:58,861 INFO L225 Difference]: With dead ends: 305 [2018-12-03 15:23:58,861 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:23:58,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:23:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:23:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:23:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:23:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:23:58,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205 [2018-12-03 15:23:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:58,863 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:23:58,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:23:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:23:58,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:23:58,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:23:59,622 WARN L180 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 1827 DAG size of output: 400 [2018-12-03 15:24:00,262 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 1832 DAG size of output: 407 [2018-12-03 15:24:03,096 WARN L180 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-12-03 15:24:05,585 WARN L180 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-12-03 15:24:05,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 44) no Hoare annotation was computed. [2018-12-03 15:24:05,590 INFO L444 ceAbstractionStarter]: At program point L30(lines 30 42) the Hoare annotation is: false [2018-12-03 15:24:05,590 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 44) no Hoare annotation was computed. [2018-12-03 15:24:05,590 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 44) no Hoare annotation was computed. [2018-12-03 15:24:05,591 INFO L444 ceAbstractionStarter]: At program point L22(lines 22 37) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 15:24:05,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2018-12-03 15:24:05,592 INFO L444 ceAbstractionStarter]: At program point L41(lines 15 41) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 15:24:05,614 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:24:05 BoogieIcfgContainer [2018-12-03 15:24:05,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:24:05,615 INFO L168 Benchmark]: Toolchain (without parser) took 151218.08 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -125.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:24:05,616 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:24:05,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:24:05,617 INFO L168 Benchmark]: Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:24:05,617 INFO L168 Benchmark]: RCFGBuilder took 333.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:24:05,618 INFO L168 Benchmark]: TraceAbstraction took 150818.34 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -146.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:24:05,620 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 333.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 150818.34 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -146.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 150.7s OverallTime, 65 OverallIterations, 101 TraceHistogramMax, 20.2s AutomataDifference, 0.0s DeadEndRemovalTime, 6.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 332 SDtfs, 1473 SDslu, 6215 SDs, 0 SdLazy, 9629 SolverSat, 2352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13456 GetRequests, 9202 SyntacticMatches, 1132 SemanticMatches, 3122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125668 ImplicationChecksByTransitivity, 112.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 65 MinimizatonAttempts, 2677 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 204 NumberOfFragments, 1406 HoareAnnotationTreeSize, 3 FomulaSimplifications, 26790 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 396 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 116.7s InterpolantComputationTime, 11890 NumberOfCodeBlocks, 11298 NumberOfCodeBlocksAsserted, 821 NumberOfCheckSat, 17540 ConstructedInterpolants, 0 QuantifiedInterpolants, 5655568 SizeOfPredicates, 51 NumberOfNonLiveVariables, 12965 ConjunctsInSsa, 2045 ConjunctsInUnsatCore, 191 InterpolantComputations, 4 PerfectInterpolantSequences, 262906/532273 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...