java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:42:48,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:42:48,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:42:48,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:42:48,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:42:48,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:42:48,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:42:48,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:42:48,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:42:48,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:42:48,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:42:48,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:42:48,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:42:48,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:42:48,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:42:48,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:42:48,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:42:48,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:42:48,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:42:48,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:42:48,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:42:48,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:42:48,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:42:48,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:42:48,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:42:48,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:42:48,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:42:48,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:42:48,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:42:48,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:42:48,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:42:48,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:42:48,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:42:48,249 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:42:48,250 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:42:48,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:42:48,252 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-04 11:42:48,273 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:42:48,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:42:48,275 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:42:48,275 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:42:48,275 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:42:48,275 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:42:48,276 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:42:48,276 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:42:48,276 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-04 11:42:48,276 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:42:48,276 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-04 11:42:48,277 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-04 11:42:48,277 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:42:48,277 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:42:48,277 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:42:48,278 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:42:48,278 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:42:48,279 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:42:48,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:42:48,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:42:48,279 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:42:48,279 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:42:48,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:42:48,280 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:42:48,280 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:42:48,280 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:42:48,280 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:42:48,281 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:42:48,281 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:42:48,281 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:42:48,281 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:42:48,281 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:42:48,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:48,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:42:48,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:42:48,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:42:48,282 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:42:48,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:42:48,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:42:48,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:42:48,283 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:42:48,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:42:48,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:42:48,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:42:48,336 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:42:48,336 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:42:48,337 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2018-12-04 11:42:48,338 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2018-12-04 11:42:48,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:42:48,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:42:48,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:42:48,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:42:48,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:42:48,431 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:42:48,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:42:48,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:42:48,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:42:48,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:42:48,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:42:48,756 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:42:48,756 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-04 11:42:48,757 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48 BoogieIcfgContainer [2018-12-04 11:42:48,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:42:48,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:42:48,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:42:48,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:42:48,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/2) ... [2018-12-04 11:42:48,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c89bed and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:42:48, skipping insertion in model container [2018-12-04 11:42:48,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48" (2/2) ... [2018-12-04 11:42:48,765 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2018-12-04 11:42:48,775 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:42:48,783 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:42:48,802 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:42:48,838 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:42:48,839 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:42:48,839 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:42:48,839 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:42:48,839 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:42:48,839 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:42:48,840 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:42:48,840 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:42:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-04 11:42:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:42:48,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:48,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:42:48,867 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:48,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-04 11:42:48,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:48,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:49,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:42:49,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:42:49,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:49,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:42:49,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:42:49,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:42:49,065 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-04 11:42:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:49,173 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-04 11:42:49,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:42:49,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:42:49,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:49,186 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:42:49,187 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:42:49,190 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-04 11:42:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:42:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:42:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:42:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-04 11:42:49,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-04 11:42:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:49,226 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-04 11:42:49,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:42:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-04 11:42:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:42:49,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:49,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-04 11:42:49,228 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:49,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-04 11:42:49,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:42:49,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:49,393 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-04 11:42:49,396 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-04 11:42:49,466 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:42:49,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:42:49,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:42:49,670 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 166 root evaluator evaluations with a maximum evaluation depth of 5. Performed 166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-04 11:42:49,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:42:49,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:49,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:42:49,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:42:49,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:49,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-04 11:42:49,959 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:49,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:42:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:42:49,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:42:49,960 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-04 11:42:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:49,999 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-04 11:42:50,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:42:50,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-04 11:42:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,001 INFO L225 Difference]: With dead ends: 13 [2018-12-04 11:42:50,001 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:42:50,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:42:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:42:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-04 11:42:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:42:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-04 11:42:50,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-04 11:42:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,007 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-04 11:42:50,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:42:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-04 11:42:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:42:50,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,008 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-04 11:42:50,008 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2018-12-04 11:42:50,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:42:50,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:50,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:50,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:50,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:50,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:50,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:42:50,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:50,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:42:50,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:42:50,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:50,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-04 11:42:50,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:50,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:42:50,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:42:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:42:50,307 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-04 11:42:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,410 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-04 11:42:50,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:42:50,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-04 11:42:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,411 INFO L225 Difference]: With dead ends: 16 [2018-12-04 11:42:50,411 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:42:50,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:42:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:42:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:42:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:42:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-04 11:42:50,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-04 11:42:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,416 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-04 11:42:50,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:42:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-04 11:42:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:42:50,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,417 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-04 11:42:50,417 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2018-12-04 11:42:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:42:50,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:50,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:50,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:50,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:50,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:50,586 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:50,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:50,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:50,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:42:50,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:42:50,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:50,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-04 11:42:50,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:50,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-04 11:42:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-04 11:42:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:42:50,868 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-04 11:42:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,916 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-04 11:42:50,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:42:50,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-04 11:42:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,919 INFO L225 Difference]: With dead ends: 19 [2018-12-04 11:42:50,919 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:42:50,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:42:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:42:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-04 11:42:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-04 11:42:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-04 11:42:50,925 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-04 11:42:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,926 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-04 11:42:50,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-04 11:42:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-04 11:42:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-04 11:42:50,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,927 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-04 11:42:50,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2018-12-04 11:42:50,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:42:51,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,052 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:51,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:51,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:51,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:42:51,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:42:51,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-04 11:42:51,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:42:51,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:42:51,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:42:51,245 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-04 11:42:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,323 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-04 11:42:51,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:42:51,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-04 11:42:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,326 INFO L225 Difference]: With dead ends: 22 [2018-12-04 11:42:51,326 INFO L226 Difference]: Without dead ends: 15 [2018-12-04 11:42:51,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:42:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-04 11:42:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-04 11:42:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-04 11:42:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-04 11:42:51,331 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-04 11:42:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,331 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-04 11:42:51,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:42:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-04 11:42:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-04 11:42:51,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,332 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-04 11:42:51,332 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2018-12-04 11:42:51,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:51,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:42:51,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:51,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:51,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:51,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:51,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:42:51,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:51,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:42:51,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:42:52,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:52,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-04 11:42:52,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:52,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 11:42:52,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 11:42:52,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:52,030 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-04 11:42:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:52,100 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-04 11:42:52,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:42:52,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-04 11:42:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:52,102 INFO L225 Difference]: With dead ends: 25 [2018-12-04 11:42:52,102 INFO L226 Difference]: Without dead ends: 17 [2018-12-04 11:42:52,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-04 11:42:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-04 11:42:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 11:42:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-04 11:42:52,107 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-04 11:42:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:52,108 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-04 11:42:52,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 11:42:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-04 11:42:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 11:42:52,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:52,109 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-04 11:42:52,109 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:52,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:52,109 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2018-12-04 11:42:52,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:52,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:42:52,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:52,216 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:52,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:52,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:52,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:52,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:52,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:52,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:52,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:52,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:42:52,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:42:52,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:52,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-04 11:42:52,589 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:52,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-04 11:42:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-04 11:42:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:42:52,591 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-04 11:42:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:52,664 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-04 11:42:52,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:42:52,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-04 11:42:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:52,665 INFO L225 Difference]: With dead ends: 28 [2018-12-04 11:42:52,665 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:42:52,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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-04 11:42:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:42:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-04 11:42:52,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:42:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-04 11:42:52,670 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-04 11:42:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:52,671 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-04 11:42:52,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-04 11:42:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-04 11:42:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-04 11:42:52,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:52,672 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-04 11:42:52,672 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:52,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:52,672 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2018-12-04 11:42:52,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:52,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:52,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:42:53,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:53,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:53,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:53,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:53,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:53,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:42:53,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:42:53,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:53,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-04 11:42:53,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:53,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:42:53,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:42:53,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:42:53,287 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-04 11:42:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:53,342 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-04 11:42:53,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:42:53,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-04 11:42:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:53,344 INFO L225 Difference]: With dead ends: 31 [2018-12-04 11:42:53,344 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:42:53,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:42:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:42:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-04 11:42:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:42:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-04 11:42:53,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-04 11:42:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:53,349 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-04 11:42:53,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:42:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-04 11:42:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:42:53,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:53,351 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-04 11:42:53,351 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:53,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2018-12-04 11:42:53,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:53,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:53,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:42:53,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:53,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:53,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:53,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:53,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:53,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:53,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-04 11:42:53,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:53,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:42:53,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:42:53,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:53,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-04 11:42:53,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:53,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:42:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:42:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:42:53,841 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-04 11:42:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:54,009 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-04 11:42:54,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:42:54,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-04 11:42:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:54,011 INFO L225 Difference]: With dead ends: 34 [2018-12-04 11:42:54,011 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:42:54,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:42:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:42:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-04 11:42:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-04 11:42:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-04 11:42:54,019 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-04 11:42:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:54,020 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-04 11:42:54,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:42:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-04 11:42:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-04 11:42:54,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:54,021 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-04 11:42:54,021 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:54,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:54,022 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2018-12-04 11:42:54,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:54,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:54,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:42:54,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:54,271 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:54,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:54,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:54,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:54,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:54,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:54,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:54,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:42:54,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:42:54,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:54,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-04 11:42:54,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:54,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-04 11:42:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-04 11:42:54,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:42:54,645 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-04 11:42:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:54,717 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-04 11:42:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 11:42:54,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-04 11:42:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:54,718 INFO L225 Difference]: With dead ends: 37 [2018-12-04 11:42:54,719 INFO L226 Difference]: Without dead ends: 25 [2018-12-04 11:42:54,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 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-04 11:42:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-04 11:42:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-04 11:42:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-04 11:42:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-04 11:42:54,724 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-04 11:42:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:54,724 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-04 11:42:54,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-04 11:42:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-04 11:42:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-04 11:42:54,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:54,725 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-04 11:42:54,725 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:54,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:54,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2018-12-04 11:42:54,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:54,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:54,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:42:54,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:54,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:54,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:54,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:54,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:54,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:42:54,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:42:55,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:55,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-04 11:42:55,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:55,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-04 11:42:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-04 11:42:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:42:55,983 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-04 11:42:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:56,040 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-04 11:42:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-04 11:42:56,041 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-04 11:42:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:56,042 INFO L225 Difference]: With dead ends: 40 [2018-12-04 11:42:56,043 INFO L226 Difference]: Without dead ends: 27 [2018-12-04 11:42:56,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:42:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-04 11:42:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-04 11:42:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-04 11:42:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-04 11:42:56,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-04 11:42:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-04 11:42:56,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-04 11:42:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-04 11:42:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-04 11:42:56,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:56,050 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-04 11:42:56,050 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:56,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2018-12-04 11:42:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:56,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:56,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:42:56,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:56,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:56,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:56,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:42:56,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:56,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:56,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-04 11:42:56,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:56,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:56,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-04 11:42:56,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:56,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:56,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-04 11:42:56,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2018-12-04 11:42:56,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-12-04 11:42:56,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:56,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2018-12-04 11:42:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:42:56,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:42:57,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:57,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2018-12-04 11:42:57,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:57,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-04 11:42:57,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-04 11:42:57,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:42:57,589 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2018-12-04 11:43:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:00,270 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-04 11:43:00,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:43:00,272 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2018-12-04 11:43:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:00,273 INFO L225 Difference]: With dead ends: 43 [2018-12-04 11:43:00,273 INFO L226 Difference]: Without dead ends: 29 [2018-12-04 11:43:00,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2018-12-04 11:43:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-04 11:43:00,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-04 11:43:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-04 11:43:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-04 11:43:00,279 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-04 11:43:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:00,280 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-04 11:43:00,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-04 11:43:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-04 11:43:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-04 11:43:00,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:00,281 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-04 11:43:00,281 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:00,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2018-12-04 11:43:00,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:00,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:00,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:43:00,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:00,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:00,514 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:00,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:00,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:00,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:00,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:00,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:00,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:00,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:00,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:43:00,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:43:00,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:00,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-04 11:43:00,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:00,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-04 11:43:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-04 11:43:00,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:43:00,937 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-04 11:43:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:01,017 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-04 11:43:01,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:43:01,018 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-04 11:43:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:01,018 INFO L225 Difference]: With dead ends: 46 [2018-12-04 11:43:01,019 INFO L226 Difference]: Without dead ends: 31 [2018-12-04 11:43:01,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:43:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-04 11:43:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-04 11:43:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 11:43:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-04 11:43:01,026 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-04 11:43:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:01,026 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-04 11:43:01,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-04 11:43:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-04 11:43:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 11:43:01,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:01,027 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-04 11:43:01,027 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:01,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,028 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2018-12-04 11:43:01,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:01,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:01,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:43:01,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:01,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:01,244 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:01,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:01,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:01,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:01,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:01,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:01,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:43:01,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:43:01,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:01,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-04 11:43:01,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:01,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-04 11:43:01,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-04 11:43:01,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:43:01,731 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-04 11:43:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:01,851 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-04 11:43:01,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 11:43:01,852 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-04 11:43:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:01,852 INFO L225 Difference]: With dead ends: 49 [2018-12-04 11:43:01,853 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:43:01,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:43:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:43:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-04 11:43:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-04 11:43:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-04 11:43:01,861 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-04 11:43:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:01,861 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-04 11:43:01,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-04 11:43:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-04 11:43:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-04 11:43:01,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:01,862 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-04 11:43:01,862 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:01,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2018-12-04 11:43:01,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:01,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:43:02,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:02,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:02,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:02,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,309 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:02,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:02,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:02,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 11:43:02,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:02,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:43:02,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:43:02,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:02,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2018-12-04 11:43:02,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:02,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:43:02,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:43:02,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:43:02,866 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-04 11:43:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:02,979 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-04 11:43:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-04 11:43:02,980 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-04 11:43:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:02,980 INFO L225 Difference]: With dead ends: 52 [2018-12-04 11:43:02,981 INFO L226 Difference]: Without dead ends: 35 [2018-12-04 11:43:02,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:43:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-04 11:43:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-04 11:43:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 11:43:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-04 11:43:02,987 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-04 11:43:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:02,987 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-04 11:43:02,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:43:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-04 11:43:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 11:43:02,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:02,988 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-04 11:43:02,989 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:02,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2018-12-04 11:43:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:43:03,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:03,248 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:03,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:03,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:03,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:03,258 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:03,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:03,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:03,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:43:03,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:43:04,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:04,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-04 11:43:04,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:04,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-04 11:43:04,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-04 11:43:04,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:43:04,296 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-04 11:43:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:04,489 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-04 11:43:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 11:43:04,489 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-04 11:43:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:04,489 INFO L225 Difference]: With dead ends: 55 [2018-12-04 11:43:04,490 INFO L226 Difference]: Without dead ends: 37 [2018-12-04 11:43:04,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:43:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-04 11:43:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-04 11:43:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-04 11:43:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-04 11:43:04,496 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-04 11:43:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:04,497 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-04 11:43:04,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-04 11:43:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-04 11:43:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-04 11:43:04,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:04,498 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-04 11:43:04,498 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:04,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2018-12-04 11:43:04,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:43:04,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:04,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:04,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:04,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:04,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:04,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:04,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:43:04,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:43:05,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:05,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-04 11:43:05,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:05,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-04 11:43:05,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-04 11:43:05,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:43:05,653 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-04 11:43:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:05,717 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-04 11:43:05,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:43:05,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-04 11:43:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:05,719 INFO L225 Difference]: With dead ends: 58 [2018-12-04 11:43:05,719 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:43:05,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:43:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:43:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-04 11:43:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-04 11:43:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-04 11:43:05,725 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-04 11:43:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:05,726 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-04 11:43:05,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-04 11:43:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-04 11:43:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-04 11:43:05,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,727 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-04 11:43:05,727 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:05,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2018-12-04 11:43:05,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:43:06,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:06,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:06,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:06,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:06,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:06,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:06,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:06,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:07,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-04 11:43:07,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:07,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:43:07,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:43:07,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:07,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-04 11:43:07,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:07,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-04 11:43:07,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-04 11:43:07,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:07,583 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-04 11:43:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:07,813 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-04 11:43:07,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:43:07,813 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-04 11:43:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:07,814 INFO L225 Difference]: With dead ends: 61 [2018-12-04 11:43:07,814 INFO L226 Difference]: Without dead ends: 41 [2018-12-04 11:43:07,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-04 11:43:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-04 11:43:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-04 11:43:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-04 11:43:07,820 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-04 11:43:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:07,820 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-04 11:43:07,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-04 11:43:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-04 11:43:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-04 11:43:07,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:07,821 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-04 11:43:07,821 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:07,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:07,822 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2018-12-04 11:43:07,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:07,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:07,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:07,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:07,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:43:08,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:08,137 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:08,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:08,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:08,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:08,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:08,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:08,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:08,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:43:08,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:43:08,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:08,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-04 11:43:08,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:08,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-04 11:43:08,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-04 11:43:08,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:43:08,712 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-04 11:43:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:08,913 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-04 11:43:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-04 11:43:08,913 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-04 11:43:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:08,914 INFO L225 Difference]: With dead ends: 64 [2018-12-04 11:43:08,914 INFO L226 Difference]: Without dead ends: 43 [2018-12-04 11:43:08,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:43:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-04 11:43:08,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-04 11:43:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-04 11:43:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-04 11:43:08,922 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-04 11:43:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:08,922 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-04 11:43:08,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-04 11:43:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-04 11:43:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-04 11:43:08,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:08,924 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-04 11:43:08,924 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:08,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2018-12-04 11:43:08,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:08,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:43:09,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:09,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:09,262 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:09,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:09,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:09,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:09,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:09,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:09,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:43:09,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:43:10,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:10,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-04 11:43:10,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:10,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-04 11:43:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-04 11:43:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:43:10,063 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-04 11:43:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:10,136 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-04 11:43:10,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 11:43:10,137 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-04 11:43:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:10,138 INFO L225 Difference]: With dead ends: 67 [2018-12-04 11:43:10,138 INFO L226 Difference]: Without dead ends: 45 [2018-12-04 11:43:10,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:43:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-04 11:43:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-04 11:43:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 11:43:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-04 11:43:10,145 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-04 11:43:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:10,145 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-04 11:43:10,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-04 11:43:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-04 11:43:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 11:43:10,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:10,146 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-04 11:43:10,147 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:10,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:10,147 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2018-12-04 11:43:10,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:10,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:10,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:10,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:10,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:43:10,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:10,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:10,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:10,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:10,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:10,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:10,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:10,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:11,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 11:43:11,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:11,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:43:11,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:43:11,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:11,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-04 11:43:11,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:11,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:43:11,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:43:11,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:43:11,750 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-04 11:43:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:11,847 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-04 11:43:11,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-04 11:43:11,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-04 11:43:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:11,848 INFO L225 Difference]: With dead ends: 70 [2018-12-04 11:43:11,848 INFO L226 Difference]: Without dead ends: 47 [2018-12-04 11:43:11,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:43:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-04 11:43:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-04 11:43:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-04 11:43:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-04 11:43:11,854 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-04 11:43:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:11,854 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-04 11:43:11,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:43:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-04 11:43:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-04 11:43:11,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:11,855 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-04 11:43:11,855 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:11,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2018-12-04 11:43:11,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:11,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:11,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:11,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:43:12,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:12,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:12,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:12,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:12,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:12,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:12,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:12,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:12,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:12,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:12,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:43:12,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:43:12,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:12,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-04 11:43:12,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:12,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-04 11:43:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-04 11:43:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:12,975 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-04 11:43:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:13,062 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-04 11:43:13,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:43:13,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-04 11:43:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:13,067 INFO L225 Difference]: With dead ends: 73 [2018-12-04 11:43:13,067 INFO L226 Difference]: Without dead ends: 49 [2018-12-04 11:43:13,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-04 11:43:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-04 11:43:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 11:43:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-04 11:43:13,073 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-04 11:43:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:13,073 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-04 11:43:13,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-04 11:43:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-04 11:43:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 11:43:13,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:13,074 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-04 11:43:13,074 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:13,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:13,075 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2018-12-04 11:43:13,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:13,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:13,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:13,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:13,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:43:13,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:13,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:13,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:13,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:13,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:13,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:13,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:13,381 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:13,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:43:13,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:43:14,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:14,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-04 11:43:14,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:14,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-04 11:43:14,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-04 11:43:14,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:43:14,045 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-04 11:43:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:14,128 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-04 11:43:14,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-04 11:43:14,129 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-04 11:43:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:14,130 INFO L225 Difference]: With dead ends: 76 [2018-12-04 11:43:14,130 INFO L226 Difference]: Without dead ends: 51 [2018-12-04 11:43:14,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:43:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-04 11:43:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-04 11:43:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-04 11:43:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-04 11:43:14,136 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-04 11:43:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:14,136 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-04 11:43:14,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-04 11:43:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-04 11:43:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-04 11:43:14,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:14,137 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-04 11:43:14,137 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:14,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2018-12-04 11:43:14,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:14,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:14,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:43:14,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:14,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:14,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:14,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:14,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:14,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:14,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:14,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 11:43:14,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:14,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:43:14,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:43:16,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:16,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2018-12-04 11:43:16,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:16,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 11:43:16,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 11:43:16,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:43:16,774 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-04 11:43:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:16,841 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-04 11:43:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:43:16,841 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-04 11:43:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:16,842 INFO L225 Difference]: With dead ends: 79 [2018-12-04 11:43:16,842 INFO L226 Difference]: Without dead ends: 53 [2018-12-04 11:43:16,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:43:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-04 11:43:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-04 11:43:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-04 11:43:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-04 11:43:16,848 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-04 11:43:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:16,848 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-04 11:43:16,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 11:43:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-04 11:43:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-04 11:43:16,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:16,849 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-04 11:43:16,849 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:16,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:16,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2018-12-04 11:43:16,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:16,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:16,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:16,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:16,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:43:17,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:17,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:17,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:17,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:17,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:17,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:17,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:17,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:17,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:17,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:43:17,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:43:18,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:18,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-04 11:43:18,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:18,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:43:18,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:43:18,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:43:18,764 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-04 11:43:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:18,900 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-04 11:43:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:43:18,900 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-04 11:43:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:18,901 INFO L225 Difference]: With dead ends: 82 [2018-12-04 11:43:18,901 INFO L226 Difference]: Without dead ends: 55 [2018-12-04 11:43:18,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:43:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-04 11:43:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-04 11:43:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-04 11:43:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-04 11:43:18,908 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-04 11:43:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:18,908 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-04 11:43:18,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:43:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-04 11:43:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-04 11:43:18,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:18,909 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-04 11:43:18,909 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:18,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2018-12-04 11:43:18,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:18,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:18,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:43:19,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:19,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:19,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:19,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:19,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:19,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:43:19,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:43:20,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:20,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-04 11:43:20,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:20,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-04 11:43:20,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-04 11:43:20,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:43:20,263 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-04 11:43:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:20,374 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-04 11:43:20,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-04 11:43:20,375 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-04 11:43:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:20,375 INFO L225 Difference]: With dead ends: 85 [2018-12-04 11:43:20,376 INFO L226 Difference]: Without dead ends: 57 [2018-12-04 11:43:20,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:43:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-04 11:43:20,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-04 11:43:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-04 11:43:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-04 11:43:20,380 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-04 11:43:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:20,380 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-04 11:43:20,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-04 11:43:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-04 11:43:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-04 11:43:20,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:20,381 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-04 11:43:20,381 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:20,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:20,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2018-12-04 11:43:20,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:20,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:20,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:43:20,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:20,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:20,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:20,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:20,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:20,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:20,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:20,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:21,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-04 11:43:21,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:21,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:43:21,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:43:21,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:21,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2018-12-04 11:43:21,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:21,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:43:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:43:21,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:43:21,944 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-04 11:43:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:22,034 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-04 11:43:22,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-04 11:43:22,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-04 11:43:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:22,036 INFO L225 Difference]: With dead ends: 88 [2018-12-04 11:43:22,036 INFO L226 Difference]: Without dead ends: 59 [2018-12-04 11:43:22,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:43:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-04 11:43:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-04 11:43:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 11:43:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-04 11:43:22,042 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-04 11:43:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:22,042 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-04 11:43:22,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:43:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-04 11:43:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 11:43:22,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:22,043 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-04 11:43:22,043 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:22,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2018-12-04 11:43:22,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:22,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:22,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:22,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:22,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:43:22,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:22,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:22,680 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:22,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:22,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:22,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:22,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:22,690 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:22,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:22,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:22,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:43:22,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:43:23,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:23,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-04 11:43:23,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:23,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-04 11:43:23,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-04 11:43:23,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:43:23,622 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-04 11:43:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:23,747 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-12-04 11:43:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 11:43:23,747 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-04 11:43:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:23,748 INFO L225 Difference]: With dead ends: 91 [2018-12-04 11:43:23,748 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:43:23,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:43:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:43:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-04 11:43:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-04 11:43:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-04 11:43:23,752 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-04 11:43:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:23,753 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-04 11:43:23,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-04 11:43:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-04 11:43:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-04 11:43:23,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:23,754 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-04 11:43:23,754 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:23,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:23,754 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2018-12-04 11:43:23,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:23,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:23,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:23,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:23,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:43:24,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:24,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:24,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:24,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:24,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:24,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:24,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:24,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:24,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:43:24,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:43:25,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:25,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-04 11:43:25,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:25,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-04 11:43:25,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-04 11:43:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:43:25,391 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-04 11:43:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:25,530 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-04 11:43:25,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:43:25,531 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-04 11:43:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:25,532 INFO L225 Difference]: With dead ends: 94 [2018-12-04 11:43:25,532 INFO L226 Difference]: Without dead ends: 63 [2018-12-04 11:43:25,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:43:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-04 11:43:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-04 11:43:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 11:43:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-04 11:43:25,536 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-04 11:43:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:25,536 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-04 11:43:25,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-04 11:43:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-04 11:43:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 11:43:25,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:25,536 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-04 11:43:25,537 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:25,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2018-12-04 11:43:25,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:25,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:25,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:43:26,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:26,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:26,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:26,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:26,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:26,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:26,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:26,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:26,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 11:43:26,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:26,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:43:26,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:43:27,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:27,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2018-12-04 11:43:27,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:27,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 11:43:27,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 11:43:27,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:43:27,811 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-04 11:43:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:27,883 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-04 11:43:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:43:27,884 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-04 11:43:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:27,884 INFO L225 Difference]: With dead ends: 97 [2018-12-04 11:43:27,884 INFO L226 Difference]: Without dead ends: 65 [2018-12-04 11:43:27,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:43:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-04 11:43:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-04 11:43:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-04 11:43:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-04 11:43:27,889 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-12-04 11:43:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:27,890 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-04 11:43:27,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 11:43:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-04 11:43:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-04 11:43:27,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:27,890 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-04 11:43:27,890 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:27,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2018-12-04 11:43:27,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:27,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:27,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:43:28,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:28,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:28,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:28,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:28,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:28,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:28,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:28,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:28,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:28,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:28,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:43:28,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:43:29,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:29,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-04 11:43:29,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:29,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-04 11:43:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-04 11:43:29,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:43:29,498 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-04 11:43:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:29,629 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-04 11:43:29,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-04 11:43:29,629 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-04 11:43:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:29,630 INFO L225 Difference]: With dead ends: 100 [2018-12-04 11:43:29,630 INFO L226 Difference]: Without dead ends: 67 [2018-12-04 11:43:29,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:43:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-04 11:43:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-04 11:43:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-04 11:43:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-04 11:43:29,635 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-04 11:43:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:29,636 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-04 11:43:29,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-04 11:43:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-04 11:43:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-04 11:43:29,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:29,636 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-04 11:43:29,637 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:29,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2018-12-04 11:43:29,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:29,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:29,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:43:30,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:30,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:30,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:30,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:30,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:30,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:30,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:30,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:43:30,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:43:31,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:31,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-04 11:43:31,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:31,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-04 11:43:31,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-04 11:43:31,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:43:31,937 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-04 11:43:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:32,081 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-12-04 11:43:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 11:43:32,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-04 11:43:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:32,083 INFO L225 Difference]: With dead ends: 103 [2018-12-04 11:43:32,083 INFO L226 Difference]: Without dead ends: 69 [2018-12-04 11:43:32,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:43:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-04 11:43:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-04 11:43:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-04 11:43:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-04 11:43:32,087 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-04 11:43:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:32,087 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-04 11:43:32,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-04 11:43:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-04 11:43:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-04 11:43:32,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:32,088 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-04 11:43:32,088 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:32,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:32,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2018-12-04 11:43:32,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:32,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:32,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:32,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:32,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:43:32,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:32,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:32,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:32,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:32,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:32,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:32,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:32,947 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:33,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-04 11:43:33,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:33,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:43:33,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:43:34,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:34,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-04 11:43:34,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:34,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:43:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:43:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:43:34,442 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-04 11:43:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:34,610 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-04 11:43:34,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:43:34,611 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-04 11:43:34,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:34,611 INFO L225 Difference]: With dead ends: 106 [2018-12-04 11:43:34,611 INFO L226 Difference]: Without dead ends: 71 [2018-12-04 11:43:34,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:43:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-04 11:43:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-04 11:43:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-04 11:43:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-04 11:43:34,616 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-04 11:43:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:34,616 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-04 11:43:34,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:43:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-04 11:43:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-04 11:43:34,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:34,617 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-04 11:43:34,617 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:34,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2018-12-04 11:43:34,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:34,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:34,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:43:35,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:35,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:35,164 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:35,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:35,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:35,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:35,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:35,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:35,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:35,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:35,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:43:35,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:43:36,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:36,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-04 11:43:36,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:36,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-04 11:43:36,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-04 11:43:36,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:36,521 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-04 11:43:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:36,680 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-12-04 11:43:36,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 11:43:36,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-04 11:43:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:36,682 INFO L225 Difference]: With dead ends: 109 [2018-12-04 11:43:36,682 INFO L226 Difference]: Without dead ends: 73 [2018-12-04 11:43:36,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-04 11:43:36,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-04 11:43:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 11:43:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-04 11:43:36,686 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-12-04 11:43:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:36,686 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-04 11:43:36,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-04 11:43:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-04 11:43:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 11:43:36,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:36,687 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-04 11:43:36,687 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:36,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2018-12-04 11:43:36,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:36,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:36,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:36,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:36,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:43:37,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:37,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:37,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:37,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:37,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:37,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:37,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:37,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:37,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:43:37,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:43:39,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:39,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-04 11:43:39,224 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:39,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-04 11:43:39,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-04 11:43:39,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:43:39,225 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-04 11:43:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:39,380 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-04 11:43:39,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:43:39,381 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-04 11:43:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:39,381 INFO L225 Difference]: With dead ends: 112 [2018-12-04 11:43:39,381 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 11:43:39,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:43:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 11:43:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-04 11:43:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-04 11:43:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-04 11:43:39,385 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-04 11:43:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:39,386 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-04 11:43:39,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-04 11:43:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-04 11:43:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-04 11:43:39,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:39,387 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-04 11:43:39,387 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:39,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2018-12-04 11:43:39,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:39,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:39,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:39,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:39,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:43:40,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:40,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:40,009 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:40,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:40,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:40,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:40,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:40,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:40,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-04 11:43:40,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:40,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:43:40,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:43:41,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:41,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-04 11:43:41,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:41,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 11:43:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 11:43:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:43:41,959 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-04 11:43:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:42,106 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-04 11:43:42,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-04 11:43:42,107 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-04 11:43:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:42,107 INFO L225 Difference]: With dead ends: 115 [2018-12-04 11:43:42,107 INFO L226 Difference]: Without dead ends: 77 [2018-12-04 11:43:42,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:43:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-04 11:43:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-04 11:43:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-04 11:43:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-04 11:43:42,112 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-04 11:43:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:42,112 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-04 11:43:42,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 11:43:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-04 11:43:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-04 11:43:42,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:42,113 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-04 11:43:42,113 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:42,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:42,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2018-12-04 11:43:42,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:42,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:42,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:42,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:42,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:43:42,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:42,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:42,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:42,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:42,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:42,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:42,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:42,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:42,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:42,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:42,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:43:42,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:43:44,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:44,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-04 11:43:44,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:44,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-04 11:43:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-04 11:43:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:43:44,763 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-04 11:43:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:44,907 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-12-04 11:43:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:43:44,907 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-04 11:43:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:44,908 INFO L225 Difference]: With dead ends: 118 [2018-12-04 11:43:44,908 INFO L226 Difference]: Without dead ends: 79 [2018-12-04 11:43:44,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 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-04 11:43:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-04 11:43:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-04 11:43:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-04 11:43:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-04 11:43:44,913 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-04 11:43:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:44,913 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-04 11:43:44,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-04 11:43:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-04 11:43:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-04 11:43:44,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:44,914 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-04 11:43:44,914 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:44,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:44,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2018-12-04 11:43:44,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:44,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:44,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:44,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:44,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:43:45,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:45,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:45,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:45,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:45,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:45,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:45,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:45,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:45,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:43:45,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:43:47,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:47,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-04 11:43:47,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:47,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-04 11:43:47,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-04 11:43:47,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:43:47,219 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-04 11:43:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:47,351 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-12-04 11:43:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 11:43:47,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-04 11:43:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:47,352 INFO L225 Difference]: With dead ends: 121 [2018-12-04 11:43:47,352 INFO L226 Difference]: Without dead ends: 81 [2018-12-04 11:43:47,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:43:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-04 11:43:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-04 11:43:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-04 11:43:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-04 11:43:47,356 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-04 11:43:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:47,357 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-04 11:43:47,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-04 11:43:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-04 11:43:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-04 11:43:47,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:47,357 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-04 11:43:47,357 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:47,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2018-12-04 11:43:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:47,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:43:48,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:48,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:48,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:48,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:48,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:48,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:48,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:48,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:48,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 11:43:48,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:48,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:43:48,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:43:50,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:50,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-04 11:43:50,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:50,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:43:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:43:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:43:50,855 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-04 11:43:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:51,004 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-12-04 11:43:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-04 11:43:51,005 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-04 11:43:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:51,006 INFO L225 Difference]: With dead ends: 124 [2018-12-04 11:43:51,006 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 11:43:51,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:43:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 11:43:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-04 11:43:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-04 11:43:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-04 11:43:51,009 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-04 11:43:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:51,010 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-04 11:43:51,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:43:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-04 11:43:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-04 11:43:51,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:51,010 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-04 11:43:51,010 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:51,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2018-12-04 11:43:51,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:51,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:51,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:43:51,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:51,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:51,971 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:51,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:51,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:51,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:51,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:51,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:52,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:52,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:52,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:43:52,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:43:54,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:54,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-04 11:43:54,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:54,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-04 11:43:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-04 11:43:54,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:43:54,121 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-04 11:43:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:54,271 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-12-04 11:43:54,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-04 11:43:54,272 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-04 11:43:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:54,272 INFO L225 Difference]: With dead ends: 127 [2018-12-04 11:43:54,272 INFO L226 Difference]: Without dead ends: 85 [2018-12-04 11:43:54,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:43:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-04 11:43:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-04 11:43:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-04 11:43:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-04 11:43:54,276 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-04 11:43:54,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:54,277 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-04 11:43:54,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-04 11:43:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-04 11:43:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-04 11:43:54,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:54,277 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-04 11:43:54,278 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:54,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2018-12-04 11:43:54,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:54,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:54,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:43:54,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:54,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:54,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:54,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:54,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:54,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:54,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:54,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:55,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:43:55,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:43:57,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:57,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-04 11:43:57,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:57,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-04 11:43:57,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-04 11:43:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:43:57,015 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-04 11:43:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:57,162 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-04 11:43:57,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-04 11:43:57,162 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-04 11:43:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:57,163 INFO L225 Difference]: With dead ends: 130 [2018-12-04 11:43:57,163 INFO L226 Difference]: Without dead ends: 87 [2018-12-04 11:43:57,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:43:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-04 11:43:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-04 11:43:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 11:43:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-04 11:43:57,169 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-04 11:43:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:57,169 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-04 11:43:57,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-04 11:43:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-04 11:43:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 11:43:57,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:57,170 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-04 11:43:57,170 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:57,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:57,170 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2018-12-04 11:43:57,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:57,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:57,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:57,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:57,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:43:57,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:57,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:57,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:57,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:57,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:57,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:43:57,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:57,947 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:58,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 11:43:58,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:58,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:43:58,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:44:00,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:00,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-04 11:44:00,572 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:00,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 11:44:00,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 11:44:00,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:44:00,574 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-04 11:44:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:00,729 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-04 11:44:00,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 11:44:00,729 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-04 11:44:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:00,730 INFO L225 Difference]: With dead ends: 133 [2018-12-04 11:44:00,730 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 11:44:00,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:44:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 11:44:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-04 11:44:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-04 11:44:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-04 11:44:00,735 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-12-04 11:44:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:00,735 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-04 11:44:00,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 11:44:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-04 11:44:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-04 11:44:00,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:00,736 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-04 11:44:00,736 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:00,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2018-12-04 11:44:00,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:00,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:00,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:44:02,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:02,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:02,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:02,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:02,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:02,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:02,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:02,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:02,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:02,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:02,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:44:03,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:44:05,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:05,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-04 11:44:05,436 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:05,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-04 11:44:05,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-04 11:44:05,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:44:05,438 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-04 11:44:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:05,584 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-12-04 11:44:05,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-04 11:44:05,584 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-04 11:44:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:05,585 INFO L225 Difference]: With dead ends: 136 [2018-12-04 11:44:05,585 INFO L226 Difference]: Without dead ends: 91 [2018-12-04 11:44:05,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:44:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-04 11:44:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-04 11:44:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-04 11:44:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-04 11:44:05,590 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-04 11:44:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:05,591 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-04 11:44:05,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-04 11:44:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-04 11:44:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-04 11:44:05,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:05,592 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-04 11:44:05,592 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:05,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:05,592 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2018-12-04 11:44:05,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:05,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:05,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:05,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:05,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:44:07,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:07,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:07,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:07,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:07,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:07,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:07,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:07,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:07,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:44:07,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:44:09,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:09,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-04 11:44:09,550 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:09,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-04 11:44:09,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-04 11:44:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:44:09,552 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-04 11:44:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:10,190 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-12-04 11:44:10,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-04 11:44:10,190 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-04 11:44:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:10,191 INFO L225 Difference]: With dead ends: 139 [2018-12-04 11:44:10,191 INFO L226 Difference]: Without dead ends: 93 [2018-12-04 11:44:10,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:44:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-04 11:44:10,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-04 11:44:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-04 11:44:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-04 11:44:10,194 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-04 11:44:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:10,194 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-04 11:44:10,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-04 11:44:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-04 11:44:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-04 11:44:10,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:10,195 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-04 11:44:10,195 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:10,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2018-12-04 11:44:10,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:10,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:10,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:44:11,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:11,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:11,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:11,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:11,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:11,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:11,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:11,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:11,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-04 11:44:11,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:11,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:44:12,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:44:14,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:14,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2018-12-04 11:44:14,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:14,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:44:14,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:44:14,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:44:14,329 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-04 11:44:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:15,339 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-12-04 11:44:15,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 11:44:15,339 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-04 11:44:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:15,340 INFO L225 Difference]: With dead ends: 142 [2018-12-04 11:44:15,340 INFO L226 Difference]: Without dead ends: 95 [2018-12-04 11:44:15,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:44:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-04 11:44:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-04 11:44:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-04 11:44:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-04 11:44:15,345 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-04 11:44:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:15,345 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-04 11:44:15,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:44:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-04 11:44:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-04 11:44:15,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:15,346 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-04 11:44:15,346 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:15,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2018-12-04 11:44:15,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:15,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:15,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:15,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:44:16,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:16,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:16,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:16,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:16,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:16,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:16,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:16,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:16,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:16,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:16,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:44:16,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:44:19,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:19,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-04 11:44:19,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:19,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-04 11:44:19,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-04 11:44:19,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:19,355 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-04 11:44:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:19,536 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-04 11:44:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 11:44:19,537 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-04 11:44:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:19,537 INFO L225 Difference]: With dead ends: 145 [2018-12-04 11:44:19,538 INFO L226 Difference]: Without dead ends: 97 [2018-12-04 11:44:19,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-04 11:44:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-04 11:44:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-04 11:44:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-04 11:44:19,541 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-12-04 11:44:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:19,542 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-04 11:44:19,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-04 11:44:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-04 11:44:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-04 11:44:19,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:19,542 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-04 11:44:19,542 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:19,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:19,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2018-12-04 11:44:19,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:19,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:19,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:19,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:19,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:44:20,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:20,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:20,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:20,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:20,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:20,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:20,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:20,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:20,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:44:20,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:44:23,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:23,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-04 11:44:23,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:23,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-04 11:44:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-04 11:44:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:44:23,100 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-04 11:44:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:23,370 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-12-04 11:44:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-04 11:44:23,370 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-04 11:44:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:23,371 INFO L225 Difference]: With dead ends: 148 [2018-12-04 11:44:23,371 INFO L226 Difference]: Without dead ends: 99 [2018-12-04 11:44:23,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:44:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-04 11:44:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-04 11:44:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-04 11:44:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-04 11:44:23,375 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-04 11:44:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:23,375 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-04 11:44:23,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-04 11:44:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-04 11:44:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-04 11:44:23,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:23,376 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-04 11:44:23,376 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:23,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:23,376 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2018-12-04 11:44:23,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:23,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:23,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:44:24,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:24,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:24,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:24,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:24,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:24,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:24,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:24,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:26,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 11:44:26,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:26,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:44:26,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:44:29,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:29,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-04 11:44:29,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:29,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 11:44:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 11:44:29,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:44:29,952 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-04 11:44:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:30,329 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-12-04 11:44:30,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 11:44:30,330 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-04 11:44:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:30,330 INFO L225 Difference]: With dead ends: 151 [2018-12-04 11:44:30,330 INFO L226 Difference]: Without dead ends: 101 [2018-12-04 11:44:30,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:44:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-04 11:44:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-04 11:44:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 11:44:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-04 11:44:30,336 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-04 11:44:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:30,336 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-04 11:44:30,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 11:44:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-04 11:44:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 11:44:30,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:30,337 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-04 11:44:30,337 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:30,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2018-12-04 11:44:30,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:30,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:30,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:30,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:30,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:44:32,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:32,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:32,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:32,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:32,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:32,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:32,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:32,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:32,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:32,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:32,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:44:32,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:44:35,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:35,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-04 11:44:35,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:35,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-04 11:44:35,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-04 11:44:35,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:44:35,456 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-04 11:44:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:35,682 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-12-04 11:44:35,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-04 11:44:35,683 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-04 11:44:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:35,684 INFO L225 Difference]: With dead ends: 154 [2018-12-04 11:44:35,684 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 11:44:35,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:44:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 11:44:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-04 11:44:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-04 11:44:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-04 11:44:35,689 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-04 11:44:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:35,690 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-04 11:44:35,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-04 11:44:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-04 11:44:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-04 11:44:35,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:35,691 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-04 11:44:35,691 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:35,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2018-12-04 11:44:35,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:35,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:35,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:44:36,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:36,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:36,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:36,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:36,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:36,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:36,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:36,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:36,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:44:36,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:44:39,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:39,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-04 11:44:39,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:39,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-04 11:44:39,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-04 11:44:39,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:44:39,891 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-04 11:44:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:40,120 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-12-04 11:44:40,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 11:44:40,121 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-04 11:44:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:40,121 INFO L225 Difference]: With dead ends: 157 [2018-12-04 11:44:40,122 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 11:44:40,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:44:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 11:44:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-04 11:44:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 11:44:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-04 11:44:40,127 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-04 11:44:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:40,127 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-04 11:44:40,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-04 11:44:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-04 11:44:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 11:44:40,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:40,128 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-04 11:44:40,128 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:40,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2018-12-04 11:44:40,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:40,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:40,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:40,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:40,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:44:41,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:41,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:41,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:41,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:41,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:41,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:41,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:41,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:42,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-04 11:44:42,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:42,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:44:42,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:44:45,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:45,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-04 11:44:45,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:45,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:44:45,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:44:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:44:45,952 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-04 11:44:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:46,298 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-04 11:44:46,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-04 11:44:46,299 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-04 11:44:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:46,299 INFO L225 Difference]: With dead ends: 160 [2018-12-04 11:44:46,300 INFO L226 Difference]: Without dead ends: 107 [2018-12-04 11:44:46,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:44:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-04 11:44:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-04 11:44:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-04 11:44:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-04 11:44:46,305 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-04 11:44:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:46,305 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-04 11:44:46,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:44:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-04 11:44:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-04 11:44:46,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:46,306 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-04 11:44:46,307 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:46,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2018-12-04 11:44:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:46,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:46,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:44:48,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:48,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:48,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:48,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:48,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:48,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:48,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:48,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:48,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:48,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:48,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:44:48,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:44:51,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:51,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-04 11:44:51,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:51,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-04 11:44:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-04 11:44:51,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:44:51,652 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-04 11:44:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:51,902 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-12-04 11:44:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 11:44:51,903 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-04 11:44:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:51,903 INFO L225 Difference]: With dead ends: 163 [2018-12-04 11:44:51,903 INFO L226 Difference]: Without dead ends: 109 [2018-12-04 11:44:51,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:44:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-04 11:44:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-04 11:44:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-04 11:44:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-04 11:44:51,908 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-04 11:44:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:51,909 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-04 11:44:51,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-04 11:44:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-04 11:44:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-04 11:44:51,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:51,910 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-04 11:44:51,910 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:51,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2018-12-04 11:44:51,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:51,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:51,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:51,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:51,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:44:53,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:53,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:53,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:53,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:53,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:53,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:53,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:53,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:53,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:44:53,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:44:56,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:56,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-04 11:44:56,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:56,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:44:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:44:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:44:56,592 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-04 11:44:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:56,881 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-12-04 11:44:56,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 11:44:56,883 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-04 11:44:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:56,883 INFO L225 Difference]: With dead ends: 166 [2018-12-04 11:44:56,883 INFO L226 Difference]: Without dead ends: 111 [2018-12-04 11:44:56,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:44:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-04 11:44:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-04 11:44:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-04 11:44:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-04 11:44:56,888 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-04 11:44:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:56,888 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-04 11:44:56,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:44:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-04 11:44:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-04 11:44:56,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:56,889 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-04 11:44:56,889 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:56,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2018-12-04 11:44:56,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:56,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:56,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-04 11:44:58,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:58,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:58,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:58,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:58,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:58,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:58,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:58,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:59,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-04 11:44:59,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:59,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:59,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-04 11:44:59,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:59,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:59,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-04 11:45:33,025 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-04 11:45:33,226 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:45:33,228 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-12-04 11:45:33,233 INFO L168 Benchmark]: Toolchain (without parser) took 164850.64 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 381.3 MB. Max. memory is 7.1 GB. [2018-12-04 11:45:33,235 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-04 11:45:33,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.44 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-04 11:45:33,235 INFO L168 Benchmark]: Boogie Preprocessor took 26.81 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-04 11:45:33,236 INFO L168 Benchmark]: RCFGBuilder took 299.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-04 11:45:33,236 INFO L168 Benchmark]: TraceAbstraction took 164474.59 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 360.2 MB. Max. memory is 7.1 GB. [2018-12-04 11:45:33,240 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.22 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 45.44 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 26.81 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 299.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 164474.59 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 360.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...