java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:41:13,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:41:13,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:41:13,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:41:13,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:41:13,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:41:13,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:41:13,222 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:41:13,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:41:13,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:41:13,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:41:13,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:41:13,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:41:13,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:41:13,231 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:41:13,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:41:13,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:41:13,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:41:13,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:41:13,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:41:13,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:41:13,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:41:13,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:41:13,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:41:13,252 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:41:13,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:41:13,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:41:13,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:41:13,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:41:13,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:41:13,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:41:13,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:41:13,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:41:13,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:41:13,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:41:13,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:41:13,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:41:13,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:41:13,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:41:13,273 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:41:13,273 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:41:13,273 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:41:13,273 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:41:13,273 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:41:13,274 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:41:13,274 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:41:13,274 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:41:13,274 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:41:13,274 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:41:13,274 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:41:13,275 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:41:13,275 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:41:13,275 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:41:13,276 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:41:13,276 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:41:13,276 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:41:13,276 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:41:13,276 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:41:13,277 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:41:13,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:41:13,277 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:41:13,277 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:41:13,277 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:41:13,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:41:13,278 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:41:13,278 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:41:13,278 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:41:13,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:41:13,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:41:13,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:41:13,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:41:13,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:41:13,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:41:13,279 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:41:13,280 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:41:13,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:41:13,280 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:41:13,280 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:41:13,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:41:13,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:41:13,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:41:13,348 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:41:13,348 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:41:13,349 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl [2018-12-03 16:41:13,349 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl' [2018-12-03 16:41:13,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:41:13,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:41:13,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:13,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:41:13,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:41:13,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:41:13,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:41:13,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:41:13,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:41:13,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... [2018-12-03 16:41:13,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:41:13,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:41:13,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:41:13,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:41:13,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:41:13,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:41:13,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:41:13,802 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:41:13,802 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 16:41:13,803 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:41:13 BoogieIcfgContainer [2018-12-03 16:41:13,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:41:13,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:41:13,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:41:13,808 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:41:13,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:41:13" (1/2) ... [2018-12-03 16:41:13,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100d40dd and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:41:13, skipping insertion in model container [2018-12-03 16:41:13,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:41:13" (2/2) ... [2018-12-03 16:41:13,811 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bpl [2018-12-03 16:41:13,824 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:41:13,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:41:13,853 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:41:13,894 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:41:13,894 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:41:13,894 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:41:13,894 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:41:13,895 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:41:13,895 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:41:13,895 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:41:13,895 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:41:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 16:41:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:41:13,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:13,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:41:13,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:13,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:41:13,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:13,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:13,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:14,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:14,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:41:14,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:14,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:41:14,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:41:14,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:41:14,106 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 16:41:14,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:14,163 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 16:41:14,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:41:14,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:41:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:14,179 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:41:14,181 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:41:14,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-03 16:41:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:41:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 16:41:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:41:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 16:41:14,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 16:41:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:14,226 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 16:41:14,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:41:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 16:41:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:41:14,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:14,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:41:14,227 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:14,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2018-12-03 16:41:14,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:14,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:14,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:41:14,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:14,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:41:14,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:41:14,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:41:14,369 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-03 16:41:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:14,504 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 16:41:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:41:14,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 16:41:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:14,506 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:41:14,506 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:41:14,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:41:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:41:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:41:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:41:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 16:41:14,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 16:41:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:14,510 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 16:41:14,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:41:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 16:41:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:41:14,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:14,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:41:14,511 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:14,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2018-12-03 16:41:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:14,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:14,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:14,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:14,593 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 16:41:14,595 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 16:41:14,641 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:41:14,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:41:14,885 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:41:14,887 INFO L272 AbstractInterpreter]: Visited 6 different actions 22 times. Merged at 5 different actions 11 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:41:14,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:14,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:41:14,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:14,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:14,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:14,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:14,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:15,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:41:15,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:15,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2018-12-03 16:41:15,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:15,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:41:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:41:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:41:15,165 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-12-03 16:41:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:15,209 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 16:41:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:41:15,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 16:41:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:15,211 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:41:15,211 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:41:15,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:41:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:41:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:41:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:41:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 16:41:15,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 16:41:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:15,219 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 16:41:15,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:41:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 16:41:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:41:15,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:15,220 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 16:41:15,220 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:15,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1959435275, now seen corresponding path program 2 times [2018-12-03 16:41:15,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:15,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:15,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:41:15,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:15,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:15,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:15,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:15,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:15,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:15,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:15,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:15,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:41:15,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:15,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:41:15,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:41:15,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:15,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-03 16:41:15,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:15,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:41:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:41:15,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:41:15,689 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2018-12-03 16:41:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:15,747 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 16:41:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:41:15,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 16:41:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:15,748 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:41:15,748 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:41:15,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:41:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:41:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 16:41:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:41:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 16:41:15,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-12-03 16:41:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:15,755 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 16:41:15,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:41:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 16:41:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:41:15,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:15,756 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 16:41:15,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:15,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1701183725, now seen corresponding path program 3 times [2018-12-03 16:41:15,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:15,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:15,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:41:15,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:15,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:15,868 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:15,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:15,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:15,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:15,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:15,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:15,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:15,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:15,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:41:16,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:41:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:16,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2018-12-03 16:41:16,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:16,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:41:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:41:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:41:16,137 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 9 states. [2018-12-03 16:41:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:16,178 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 16:41:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:41:16,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-03 16:41:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:16,180 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:41:16,180 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:41:16,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:41:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:41:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:41:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:41:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 16:41:16,185 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 16:41:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:16,186 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 16:41:16,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:41:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 16:41:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:41:16,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:16,187 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-12-03 16:41:16,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:16,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:16,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1295239837, now seen corresponding path program 4 times [2018-12-03 16:41:16,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:16,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:16,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:16,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:16,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:41:16,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:16,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:16,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:16,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:16,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:16,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:16,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:16,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:16,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:41:16,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 16:41:16,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:16,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2018-12-03 16:41:16,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:16,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:41:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:41:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:41:16,799 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-12-03 16:41:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:16,853 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-03 16:41:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:41:16,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-12-03 16:41:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:16,857 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:41:16,857 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:41:16,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:41:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:41:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:41:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:41:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 16:41:16,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 16:41:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:16,863 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 16:41:16,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:41:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 16:41:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:41:16,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:16,864 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-12-03 16:41:16,864 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:16,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1398752045, now seen corresponding path program 5 times [2018-12-03 16:41:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:16,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:16,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 16:41:16,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:16,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:16,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:16,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:16,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:16,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:16,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:16,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:17,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:41:17,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:17,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 16:41:17,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 16:41:17,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:17,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2018-12-03 16:41:17,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:17,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:41:17,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:41:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:41:17,502 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-12-03 16:41:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:17,558 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-03 16:41:17,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:41:17,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-12-03 16:41:17,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:17,560 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:41:17,560 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:41:17,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:41:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:41:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:41:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:41:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 16:41:17,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-12-03 16:41:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:17,567 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 16:41:17,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:41:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 16:41:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:41:17,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:17,568 INFO L402 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-12-03 16:41:17,569 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:17,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:17,569 INFO L82 PathProgramCache]: Analyzing trace with hash 149890851, now seen corresponding path program 6 times [2018-12-03 16:41:17,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:17,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:17,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:17,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:17,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:41:17,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:17,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:17,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:17,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:17,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:17,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:17,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:17,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:17,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:17,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:17,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:41:17,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:41:18,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:18,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 16:41:18,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:18,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:41:18,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:41:18,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:41:18,025 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-12-03 16:41:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:18,058 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-03 16:41:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:41:18,059 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-12-03 16:41:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:18,059 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:41:18,060 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:41:18,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:41:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:41:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:41:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:41:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 16:41:18,065 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-03 16:41:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:18,066 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 16:41:18,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:41:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 16:41:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:41:18,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:18,067 INFO L402 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-12-03 16:41:18,067 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:18,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:18,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1248978285, now seen corresponding path program 7 times [2018-12-03 16:41:18,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:18,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:18,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:41:18,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:18,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:18,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:18,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:18,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:18,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:18,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:18,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:18,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:41:18,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:41:18,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:18,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-12-03 16:41:18,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:18,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:41:18,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:41:18,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:41:18,617 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states. [2018-12-03 16:41:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:18,647 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-03 16:41:18,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:41:18,649 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-12-03 16:41:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:18,649 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:41:18,649 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:41:18,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:41:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:41:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:41:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:41:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 16:41:18,655 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-12-03 16:41:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:18,655 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 16:41:18,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:41:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 16:41:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:41:18,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:18,656 INFO L402 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1] [2018-12-03 16:41:18,657 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:18,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:18,657 INFO L82 PathProgramCache]: Analyzing trace with hash -734545693, now seen corresponding path program 8 times [2018-12-03 16:41:18,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:18,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:18,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:18,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:18,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 16:41:18,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:18,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:18,783 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:18,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:18,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:18,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:18,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:18,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:18,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:41:18,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:18,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 16:41:19,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 16:41:19,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:19,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-12-03 16:41:19,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:19,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:41:19,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:41:19,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:41:19,204 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2018-12-03 16:41:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:19,266 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-03 16:41:19,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:41:19,266 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 16:41:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:19,267 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:41:19,267 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:41:19,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:41:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:41:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:41:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:41:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 16:41:19,277 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-12-03 16:41:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:19,277 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 16:41:19,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:41:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 16:41:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:41:19,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:19,278 INFO L402 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1] [2018-12-03 16:41:19,278 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:19,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1875765165, now seen corresponding path program 9 times [2018-12-03 16:41:19,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:19,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:19,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:19,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 16:41:19,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:19,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:19,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:19,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:19,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:19,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:19,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:19,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:19,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:19,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:19,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 16:41:19,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 16:41:20,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:20,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 16:41:20,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:20,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:41:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:41:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:41:20,102 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2018-12-03 16:41:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:20,180 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-03 16:41:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:41:20,183 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-12-03 16:41:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:20,183 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:41:20,184 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:41:20,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:41:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:41:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:41:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:41:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 16:41:20,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-12-03 16:41:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:20,190 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 16:41:20,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:41:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 16:41:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:41:20,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:20,191 INFO L402 BasicCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1] [2018-12-03 16:41:20,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:20,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1112151389, now seen corresponding path program 10 times [2018-12-03 16:41:20,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:20,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:20,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:20,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:20,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 16:41:20,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:20,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:20,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:20,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:20,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:20,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:20,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:20,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:20,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 16:41:20,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 16:41:21,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:21,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-12-03 16:41:21,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:21,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:41:21,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:41:21,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:41:21,422 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 23 states. [2018-12-03 16:41:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:21,494 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-03 16:41:21,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:41:21,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-12-03 16:41:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:21,500 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:41:21,500 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:41:21,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:41:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:41:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:41:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:41:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 16:41:21,509 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-12-03 16:41:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:21,510 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 16:41:21,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:41:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 16:41:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:41:21,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:21,511 INFO L402 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2018-12-03 16:41:21,511 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:21,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash -413354477, now seen corresponding path program 11 times [2018-12-03 16:41:21,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:21,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:21,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:21,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:21,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 16:41:21,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:21,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:21,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:21,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:21,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:21,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:21,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:21,803 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:21,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:41:21,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:21,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 16:41:21,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 16:41:21,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:21,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 16:41:21,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:21,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:41:21,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:41:21,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:41:21,949 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-12-03 16:41:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:22,022 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 16:41:22,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:41:22,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-03 16:41:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:22,026 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:41:22,026 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:41:22,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:41:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:41:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-12-03 16:41:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:41:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-03 16:41:22,039 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2018-12-03 16:41:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:22,040 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-03 16:41:22,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:41:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-03 16:41:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:41:22,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:22,041 INFO L402 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-12-03 16:41:22,041 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:22,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash -836205413, now seen corresponding path program 12 times [2018-12-03 16:41:22,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:22,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:22,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 16:41:22,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:22,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:22,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:22,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:22,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:22,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:22,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:22,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:22,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:22,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:22,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 16:41:22,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 16:41:22,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:22,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2018-12-03 16:41:22,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:22,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:41:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:41:22,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:41:22,390 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-12-03 16:41:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:22,429 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-12-03 16:41:22,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:41:22,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-03 16:41:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:22,430 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:41:22,430 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:41:22,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:41:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:41:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-12-03 16:41:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:41:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-12-03 16:41:22,443 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-12-03 16:41:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:22,443 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-12-03 16:41:22,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:41:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-12-03 16:41:22,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:41:22,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:22,445 INFO L402 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-12-03 16:41:22,445 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:22,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash 21677859, now seen corresponding path program 13 times [2018-12-03 16:41:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:22,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:22,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 16:41:22,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:22,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:22,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:22,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:22,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:22,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:22,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:22,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:22,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 16:41:22,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 16:41:22,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:22,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2018-12-03 16:41:22,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:22,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:41:22,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:41:22,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:41:22,891 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-12-03 16:41:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:23,018 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-12-03 16:41:23,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:41:23,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-03 16:41:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:23,019 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:41:23,020 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:41:23,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:41:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:41:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-12-03 16:41:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:41:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-12-03 16:41:23,045 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-12-03 16:41:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:23,045 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-12-03 16:41:23,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:41:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-12-03 16:41:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:41:23,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:23,047 INFO L402 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-12-03 16:41:23,047 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:23,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:23,048 INFO L82 PathProgramCache]: Analyzing trace with hash 246775211, now seen corresponding path program 14 times [2018-12-03 16:41:23,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:23,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:23,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:23,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:23,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 16:41:23,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:23,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:23,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:23,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:23,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:23,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:23,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:23,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:23,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:41:23,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:23,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 16:41:23,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-03 16:41:23,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:23,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2018-12-03 16:41:23,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:23,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:41:23,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:41:23,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:41:23,936 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-12-03 16:41:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:24,040 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-12-03 16:41:24,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:41:24,040 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-12-03 16:41:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:24,041 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:41:24,042 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:41:24,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:41:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:41:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-12-03 16:41:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:41:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-12-03 16:41:24,061 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-12-03 16:41:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:24,061 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-12-03 16:41:24,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:41:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-12-03 16:41:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:41:24,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:24,063 INFO L402 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-12-03 16:41:24,063 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:24,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:24,064 INFO L82 PathProgramCache]: Analyzing trace with hash 693807155, now seen corresponding path program 15 times [2018-12-03 16:41:24,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:24,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:24,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:24,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:24,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 16:41:24,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:24,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:24,247 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:24,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:24,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:24,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-03 16:41:24,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:24,256 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:24,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:24,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:24,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 16:41:24,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-03 16:41:24,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:24,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2018-12-03 16:41:24,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:24,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:41:24,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:41:24,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:41:24,597 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-12-03 16:41:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:24,664 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-12-03 16:41:24,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:41:24,666 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-12-03 16:41:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:24,667 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:41:24,667 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:41:24,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:41:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:41:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-03 16:41:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:41:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-03 16:41:24,695 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-12-03 16:41:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:24,695 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-03 16:41:24,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:41:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-03 16:41:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:41:24,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:24,701 INFO L402 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-12-03 16:41:24,701 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:24,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:24,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1456716101, now seen corresponding path program 16 times [2018-12-03 16:41:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:24,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:24,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:24,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 16:41:25,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:25,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:25,017 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:25,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:25,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:25,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:25,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:25,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:41:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:25,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 16:41:25,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 16:41:25,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:25,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 16:41:25,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:25,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:41:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:41:25,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:41:25,402 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-12-03 16:41:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:25,585 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-03 16:41:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:41:25,587 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-12-03 16:41:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:25,588 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:41:25,588 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:41:25,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:41:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:41:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-12-03 16:41:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:41:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-03 16:41:25,618 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-12-03 16:41:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:25,619 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-03 16:41:25,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:41:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-03 16:41:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:41:25,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:25,620 INFO L402 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-12-03 16:41:25,627 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:25,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1961076413, now seen corresponding path program 17 times [2018-12-03 16:41:25,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:25,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:41:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:25,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 16:41:25,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:25,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:25,846 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:25,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:25,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:25,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:25,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:41:25,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:41:25,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:41:25,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:25,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 16:41:26,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 16:41:26,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:26,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 16:41:26,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:26,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:41:26,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:41:26,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:41:26,260 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-12-03 16:41:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:26,324 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-12-03 16:41:26,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:41:26,324 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-12-03 16:41:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:26,325 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:41:26,325 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:41:26,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 179 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:41:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:41:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-12-03 16:41:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:41:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-12-03 16:41:26,346 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-12-03 16:41:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:26,346 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-12-03 16:41:26,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:41:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-12-03 16:41:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:41:26,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:26,348 INFO L402 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-12-03 16:41:26,348 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:26,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -249765941, now seen corresponding path program 18 times [2018-12-03 16:41:26,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:26,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:26,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 16:41:27,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:27,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:41:27,126 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:41:27,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:41:27,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:41:27,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:41:27,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:41:27,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:41:27,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:41:27,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:41:27,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:41:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 16:41:27,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:41:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 16:41:27,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:41:27,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:41:27,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:41:27,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:41:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:41:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:41:27,523 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-12-03 16:41:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:27,606 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-03 16:41:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:41:27,606 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-12-03 16:41:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:27,607 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:41:27,608 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 16:41:27,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 201 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:41:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 16:41:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-12-03 16:41:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:41:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-12-03 16:41:27,631 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-12-03 16:41:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:27,631 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-12-03 16:41:27,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:41:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-12-03 16:41:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:41:27,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:41:27,632 INFO L402 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-12-03 16:41:27,633 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:41:27,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:41:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1574970797, now seen corresponding path program 19 times [2018-12-03 16:41:27,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:41:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:27,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:41:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:41:27,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:41:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:41:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:41:33,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:41:33,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-12-03 16:41:33,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:41:33,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 16:41:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 16:41:33,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 16:41:33,649 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-12-03 16:41:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:41:36,101 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-12-03 16:41:36,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:41:36,102 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-12-03 16:41:36,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:41:36,102 INFO L225 Difference]: With dead ends: 5119 [2018-12-03 16:41:36,102 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:41:36,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 16:41:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:41:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:41:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:41:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:41:36,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-12-03 16:41:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:41:36,112 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:41:36,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 16:41:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:41:36,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:41:36,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:41:41,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:41,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:42,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:42,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:42,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:42,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:42,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:42,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:42,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:43,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:43,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:43,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:43,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:43,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:43,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:44,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:45,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:46,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:47,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:47,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:47,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:47,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:47,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:47,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:47,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:47,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:48,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:48,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:48,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:48,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:49,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:49,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:49,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:49,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:50,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:50,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:50,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:50,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:50,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:51,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:51,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:51,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:51,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:51,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:52,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:53,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:53,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:54,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:57,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:57,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:57,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:57,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:57,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:58,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:58,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:58,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:41:59,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:00,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:00,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:01,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:01,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:02,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:02,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:03,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:03,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:04,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:04,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:05,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:05,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:05,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:05,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:06,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:06,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:06,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:07,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:07,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:08,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:08,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:08,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:08,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:08,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:09,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:10,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:10,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:10,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:11,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:14,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:14,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:15,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:15,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:16,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:17,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:17,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:18,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:18,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:19,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:19,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:20,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:20,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:21,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:21,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:21,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:21,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:21,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:22,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:22,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:24,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:25,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:25,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:28,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:28,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:30,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:37,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:37,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:39,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:41,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:41,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:42,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:43,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:43,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:48,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:50,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:52,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:55,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:55,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:56,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:56,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:58,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:59,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:01,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:09,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:18,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:32,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:43:37,576 WARN L180 SmtUtils]: Spent 2.02 m on a formula simplification. DAG size of input: 5095 DAG size of output: 2493 [2018-12-03 16:43:38,578 WARN L180 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-12-03 16:45:44,475 WARN L180 SmtUtils]: Spent 2.10 m on a formula simplification. DAG size of input: 2493 DAG size of output: 362 [2018-12-03 16:45:50,663 WARN L180 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-12-03 16:45:50,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-12-03 16:45:50,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-12-03 16:45:50,667 INFO L444 ceAbstractionStarter]: At program point L61(lines 31 61) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-12-03 16:45:50,667 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-12-03 16:45:50,667 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2018-12-03 16:45:50,667 INFO L444 ceAbstractionStarter]: At program point L44(lines 44 49) the Hoare annotation is: false [2018-12-03 16:45:50,669 INFO L444 ceAbstractionStarter]: At program point L70(lines 48 70) the Hoare annotation is: (let ((.cse38 (<= ULTIMATE.start_main_~j~5 2)) (.cse31 (<= ULTIMATE.start_main_~j~5 6)) (.cse13 (<= ULTIMATE.start_main_~j~5 5)) (.cse17 (<= ULTIMATE.start_main_~j~5 7)) (.cse6 (<= ULTIMATE.start_main_~j~5 9)) (.cse39 (<= ULTIMATE.start_main_~j~5 0)) (.cse7 (<= ULTIMATE.start_main_~j~5 3)) (.cse37 (<= ULTIMATE.start_main_~j~5 1)) (.cse29 (<= ULTIMATE.start_main_~j~5 4)) (.cse36 (<= ULTIMATE.start_main_~j~5 8)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5))) (let ((.cse22 (<= 40 ULTIMATE.start_main_~k~5)) (.cse26 (<= 60 ULTIMATE.start_main_~k~5)) (.cse27 (<= 90 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse23 (<= 70 ULTIMATE.start_main_~k~5)) (.cse12 (and .cse36 .cse4)) (.cse32 (<= 50 ULTIMATE.start_main_~k~5)) (.cse28 (and .cse29 .cse4)) (.cse21 (and .cse37 .cse4)) (.cse25 (<= 80 ULTIMATE.start_main_~k~5)) (.cse18 (<= ULTIMATE.start_main_~i~5 7)) (.cse2 (<= ULTIMATE.start_main_~i~5 4)) (.cse10 (and .cse7 .cse4)) (.cse24 (and .cse4 .cse39)) (.cse35 (<= 30 ULTIMATE.start_main_~k~5)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse16 (and .cse4 .cse6)) (.cse11 (<= ULTIMATE.start_main_~i~5 8)) (.cse14 (and .cse17 .cse4)) (.cse9 (<= ULTIMATE.start_main_~i~5 3)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse8 (<= ULTIMATE.start_main_~i~5 0)) (.cse30 (<= ULTIMATE.start_main_~i~5 2)) (.cse1 (and .cse13 .cse4)) (.cse15 (<= ULTIMATE.start_main_~i~5 6)) (.cse20 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse33 (and .cse31 .cse4)) (.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse19 (<= ULTIMATE.start_main_~i~5 5)) (.cse34 (and .cse4 .cse38))) (or (and .cse0 (<= 45 ULTIMATE.start_main_~k~5) .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse6) (and .cse0 (<= 3 ULTIMATE.start_main_~k~5) .cse7 .cse4 .cse8) (and .cse0 .cse9 .cse10 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 (<= 88 ULTIMATE.start_main_~k~5) .cse12) (and .cse0 .cse13 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse14 .cse15 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 .cse10 (<= 83 ULTIMATE.start_main_~k~5)) (and .cse0 .cse16 .cse9 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 7 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse8) (and .cse0 .cse1 .cse18 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 57 ULTIMATE.start_main_~k~5) .cse14) (and (and .cse20 .cse21) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse0 .cse22 .cse9 .cse4) (and .cse0 .cse4 .cse6 (<= 9 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse23 .cse15 .cse4) (and .cse0 .cse11 .cse24 .cse25) (and .cse0 (<= 61 ULTIMATE.start_main_~k~5) .cse21 .cse15) (and .cse0 .cse17 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and (and .cse20 .cse4) (<= 100 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 .cse24 .cse15) (and .cse0 .cse22 .cse24 .cse2) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse20 .cse12)) (and .cse0 .cse11 .cse27 .cse4) (and .cse0 (<= 78 ULTIMATE.start_main_~k~5) .cse12 .cse18) (and .cse0 .cse10 (<= 73 ULTIMATE.start_main_~k~5) .cse18) (and .cse0 (<= 34 ULTIMATE.start_main_~k~5) .cse9 .cse28) (and .cse0 .cse19 .cse26 .cse4) (and .cse0 (<= 38 ULTIMATE.start_main_~k~5) .cse9 .cse12) (and .cse0 (<= 77 ULTIMATE.start_main_~k~5) .cse14 .cse18) (and .cse0 .cse29 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 (<= 29 ULTIMATE.start_main_~k~5) .cse30 .cse4 .cse6) (and .cse0 .cse31 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse8) (and (and .cse20 .cse10) (<= 93 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 71 ULTIMATE.start_main_~k~5) .cse21 .cse18) (and .cse27 (and .cse20 .cse24)) (and .cse0 .cse16 (<= 69 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse32 .cse4 .cse2) (and .cse0 .cse9 .cse1 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 .cse28 (<= 54 ULTIMATE.start_main_~k~5) .cse19) (and .cse0 (<= 56 ULTIMATE.start_main_~k~5) .cse19 .cse33) (and (<= 92 ULTIMATE.start_main_~k~5) (and .cse20 .cse34)) (and .cse0 (<= 76 ULTIMATE.start_main_~k~5) .cse33 .cse18) (and .cse0 .cse2 .cse16 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse0 .cse14 (<= 47 ULTIMATE.start_main_~k~5) .cse2) (and (<= 99 ULTIMATE.start_main_~k~5) (and .cse20 .cse16)) (and .cse0 .cse30 .cse4 .cse35) (and .cse0 .cse31 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse12 .cse15 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 18 ULTIMATE.start_main_~k~5) .cse36 .cse4 .cse5) (and .cse0 .cse34 .cse15 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 1 ULTIMATE.start_main_~k~5) .cse37 .cse4 .cse8) (and .cse0 (<= 41 ULTIMATE.start_main_~k~5) .cse21 .cse2) (and .cse0 (<= 72 ULTIMATE.start_main_~k~5) .cse34 .cse18) (and .cse0 (<= 11 ULTIMATE.start_main_~k~5) .cse37 .cse4 .cse5) (and .cse0 .cse29 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse38) (and .cse0 .cse3 .cse30 .cse4 .cse39) (and .cse0 .cse10 .cse15 (<= 63 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse0 .cse28 .cse18) (and .cse0 (<= 64 ULTIMATE.start_main_~k~5) .cse28 .cse15) (and .cse0 .cse11 (<= 82 ULTIMATE.start_main_~k~5) .cse34) (and .cse0 .cse19 (<= 51 ULTIMATE.start_main_~k~5) .cse21) (and .cse0 .cse36 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse8) (and .cse0 .cse14 .cse9 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse0 .cse33 (<= 66 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse23 .cse24 .cse18) (and .cse0 .cse33 .cse9 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse34 (<= 42 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse19 .cse12 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 55 ULTIMATE.start_main_~k~5) .cse1) (and (and .cse20 .cse1) (<= 95 ULTIMATE.start_main_~k~5)) (and .cse0 .cse28 .cse2 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 48 ULTIMATE.start_main_~k~5) .cse2 .cse12) (and .cse0 .cse11 (<= 84 ULTIMATE.start_main_~k~5) .cse28) (and .cse0 .cse11 .cse33 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse31 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse30 (<= 27 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse30 (<= 28 ULTIMATE.start_main_~k~5) .cse36 .cse4) (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse39 .cse8) (and .cse0 .cse32 .cse19 .cse24) (and .cse0 .cse11 (<= 89 ULTIMATE.start_main_~k~5) .cse16) (and (and .cse20 .cse14) (<= 97 ULTIMATE.start_main_~k~5)) (and .cse0 .cse29 .cse30 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse16 (<= 79 ULTIMATE.start_main_~k~5) .cse18) (and (and .cse20 .cse28) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse38 .cse8) (and .cse0 .cse10 (<= 43 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse11 .cse1 (<= 85 ULTIMATE.start_main_~k~5)) (and .cse0 .cse9 .cse21 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse7 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse11 (<= 81 ULTIMATE.start_main_~k~5) .cse21) (and .cse0 .cse30 (<= 25 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse0 .cse4 .cse25 .cse18) (and .cse0 (<= 46 ULTIMATE.start_main_~k~5) .cse33 .cse2) (and .cse0 (<= 53 ULTIMATE.start_main_~k~5) .cse19 .cse10) (and .cse0 .cse24 .cse9 .cse35) (and .cse0 .cse13 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse7 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse40 .cse4 .cse39 .cse5) (and .cse0 .cse19 .cse16 (<= 59 ULTIMATE.start_main_~k~5)) (and .cse0 .cse11 .cse14 (<= 87 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 .cse4 .cse38 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 32 ULTIMATE.start_main_~k~5) .cse9 .cse34) (and .cse0 .cse40 .cse4 .cse8) (and .cse0 .cse30 (<= 21 ULTIMATE.start_main_~k~5) .cse37 .cse4) (and .cse0 (<= 65 ULTIMATE.start_main_~k~5) .cse1 .cse15) (and (and .cse20 .cse33) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 .cse34 (<= 52 ULTIMATE.start_main_~k~5))))) [2018-12-03 16:45:50,698 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:45:50 BoogieIcfgContainer [2018-12-03 16:45:50,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:45:50,699 INFO L168 Benchmark]: Toolchain (without parser) took 277302.24 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -319.3 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-12-03 16:45:50,700 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:45:50,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:45:50,701 INFO L168 Benchmark]: Boogie Preprocessor took 19.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:45:50,702 INFO L168 Benchmark]: RCFGBuilder took 350.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-03 16:45:50,702 INFO L168 Benchmark]: TraceAbstraction took 276894.30 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -340.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-12-03 16:45:50,706 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 350.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 276894.30 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -340.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 4) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 3 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 3 && 10 <= main_~m~5) && 83 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 3) && 39 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && main_~i~5 <= 6) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5) && 100 <= main_~k~5)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 4)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 78 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 73 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 34 <= main_~k~5) && main_~i~5 <= 3) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 60 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 38 <= main_~k~5) && main_~i~5 <= 3) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 93 <= main_~k~5)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 69 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 54 <= main_~k~5) && main_~i~5 <= 5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || (92 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 76 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 4) && 10 <= main_~m~5 && main_~j~5 <= 9) && 49 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 47 <= main_~k~5) && main_~i~5 <= 4)) || (99 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 41 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 6) && 63 <= main_~k~5)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 64 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 82 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 3) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 3) && 36 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 42 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 55 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 4) && 44 <= main_~k~5)) || (((10 <= main_~n~5 && 48 <= main_~k~5) && main_~i~5 <= 4) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 6 && 10 <= main_~m~5) && 86 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 6) && 26 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 28 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 2) && 24 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 79 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 43 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 5 && 10 <= main_~m~5) && 85 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1 && 10 <= main_~m~5) && 31 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 3) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 9) && 59 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 7 && 10 <= main_~m~5) && 87 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 2) && 22 <= main_~k~5)) || (((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5 && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 65 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 276.7s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 254.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 400 SDslu, 431 SDs, 0 SdLazy, 658 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1625 GetRequests, 1178 SyntacticMatches, 61 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2985 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5119 NumberOfFragments, 1940 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2338881 FormulaSimplificationTreeSizeReduction, 122.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 391585 FormulaSimplificationTreeSizeReductionInter, 132.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 2201 ConstructedInterpolants, 0 QuantifiedInterpolants, 791047 SizeOfPredicates, 36 NumberOfNonLiveVariables, 3435 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 57 InterpolantComputations, 3 PerfectInterpolantSequences, 14938/59577 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...