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/underapprox1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:46:09,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:46:09,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:46:09,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:46:09,196 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:46:09,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:46:09,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:46:09,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:46:09,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:46:09,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:46:09,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:46:09,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:46:09,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:46:09,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:46:09,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:46:09,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:46:09,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:46:09,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:46:09,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:46:09,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:46:09,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:46:09,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:46:09,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:46:09,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:46:09,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:46:09,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:46:09,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:46:09,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:46:09,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:46:09,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:46:09,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:46:09,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:46:09,258 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:46:09,258 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:46:09,260 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:46:09,260 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:46:09,261 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:46:09,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:46:09,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:46:09,284 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:46:09,284 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:46:09,285 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:46:09,285 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:46:09,285 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:46:09,286 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:46:09,286 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:46:09,286 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:46:09,286 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:46:09,286 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:46:09,287 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:46:09,287 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:46:09,287 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:46:09,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:46:09,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:46:09,289 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:46:09,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:46:09,290 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:46:09,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:46:09,290 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:46:09,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:46:09,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:46:09,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:46:09,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:46:09,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:46:09,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:46:09,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:46:09,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:46:09,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:46:09,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:46:09,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:46:09,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:46:09,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:46:09,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:46:09,295 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:46:09,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:46:09,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:46:09,295 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:46:09,295 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:46:09,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:46:09,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:46:09,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:46:09,376 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:46:09,376 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:46:09,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox1.i_3.bpl [2018-12-03 16:46:09,378 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox1.i_3.bpl' [2018-12-03 16:46:09,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:46:09,430 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:46:09,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:46:09,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:46:09,431 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:46:09,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:46:09,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:46:09,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:46:09,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:46:09,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/1) ... [2018-12-03 16:46:09,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:46:09,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:46:09,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:46:09,497 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:46:09,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (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:46:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:46:09,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:46:09,741 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:46:09,741 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:46:09,742 INFO L202 PluginConnector]: Adding new model underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:09 BoogieIcfgContainer [2018-12-03 16:46:09,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:46:09,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:46:09,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:46:09,747 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:46:09,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:46:09" (1/2) ... [2018-12-03 16:46:09,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb9062e and model type underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:46:09, skipping insertion in model container [2018-12-03 16:46:09,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:09" (2/2) ... [2018-12-03 16:46:09,750 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox1.i_3.bpl [2018-12-03 16:46:09,761 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:46:09,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:46:09,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:46:09,822 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:46:09,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:46:09,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:46:09,823 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:46:09,823 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:46:09,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:46:09,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:46:09,823 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:46:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:46:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:46:09,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:09,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:46:09,848 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:09,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:46:09,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:09,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:09,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:09,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:09,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:10,162 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 16:46:10,164 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:46:10,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:46:10,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:46:10,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:46:10,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:46:10,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:46:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:10,186 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:46:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:10,243 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:46:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:46:10,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:46:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:10,260 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:46:10,261 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:46:10,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:46:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:46:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:46:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:46:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:46:10,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:46:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:10,340 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:46:10,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:46:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:46:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:46:10,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:10,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:46:10,341 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:10,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:46:10,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:10,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:10,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:10,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:10,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:10,505 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:46:10,507 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:46:10,547 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:46:10,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:46:10,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:46:10,738 INFO L272 AbstractInterpreter]: Visited 4 different actions 14 times. Merged at 3 different actions 8 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:46:10,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:10,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:46:10,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:10,753 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:46:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:10,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:10,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:10,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:10,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:10,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 16:46:10,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:10,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:46:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:46:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:46:10,932 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 16:46:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:10,972 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:46:10,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:46:10,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 16:46:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:10,973 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:46:10,973 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:46:10,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:46:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:46:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:46:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:46:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:46:10,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:46:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:10,977 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:46:10,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:46:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:46:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:46:10,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:10,978 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:46:10,979 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:10,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:46:10,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:10,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:10,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:10,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:11,370 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:46:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:11,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:11,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:11,372 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:11,372 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:46:11,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:11,372 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:46:11,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:46:11,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:46:11,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:46:11,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:11,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:11,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:11,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:11,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 16:46:11,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:11,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:46:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:46:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:46:11,538 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 16:46:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:11,577 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:46:11,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:46:11,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 16:46:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:11,580 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:46:11,580 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:46:11,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:46:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:46:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:46:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:46:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:46:11,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:46:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:11,584 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:46:11,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:46:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:46:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:46:11,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:11,585 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:46:11,586 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:11,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:11,586 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 16:46:11,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:11,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:11,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:11,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:11,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:11,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:11,850 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:46:11,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:11,850 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:46:11,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:46:11,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:46:11,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:46:11,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:11,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:11,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:12,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 16:46:12,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:12,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:46:12,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:46:12,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:46:12,019 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 16:46:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:12,090 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:46:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:46:12,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 16:46:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:12,091 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:46:12,091 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:46:12,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:46:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:46:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:46:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:46:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:46:12,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:46:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:12,096 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:46:12,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:46:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:46:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:46:12,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:12,097 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:46:12,098 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:12,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 16:46:12,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:12,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:12,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:12,541 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:46:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:12,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:12,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:12,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:12,543 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:46:12,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:12,543 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:46:12,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:12,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:46:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:12,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:12,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:12,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:12,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 16:46:12,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:12,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:46:12,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:46:12,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:46:12,764 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 16:46:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:12,812 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:46:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:46:12,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 16:46:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:12,814 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:46:12,814 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:46:12,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:46:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:46:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:46:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:46:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:46:12,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:46:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:12,823 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:46:12,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:46:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:46:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:46:12,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:12,824 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:46:12,824 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:12,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 16:46:12,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:12,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:46:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:12,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:46:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:13,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:13,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:46:13,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:46:13,111 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:46:13,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:46:13,111 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:46:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:46:13,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:46:13,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:46:13,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:46:13,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:46:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:13,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:46:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:46:13,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:46:13,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 16:46:13,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:46:13,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:46:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:46:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:46:13,426 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 16:46:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:46:13,511 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:46:13,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:46:13,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 16:46:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:46:13,514 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:46:13,514 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:46:13,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:46:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:46:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:46:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:46:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:46:13,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:46:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:46:13,519 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:46:13,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:46:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:46:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:46:13,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:46:13,520 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:46:13,521 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:46:13,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:46:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 16:46:13,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:46:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:13,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:46:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:46:13,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:46:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 16:46:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 16:46:13,640 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 16:46:13,661 INFO L202 PluginConnector]: Adding new model underapprox1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:46:13 BoogieIcfgContainer [2018-12-03 16:46:13,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:46:13,662 INFO L168 Benchmark]: Toolchain (without parser) took 4233.98 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.8 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -724.8 MB). Peak memory consumption was 241.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:46:13,664 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:46:13,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:46:13,665 INFO L168 Benchmark]: Boogie Preprocessor took 24.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:46:13,665 INFO L168 Benchmark]: RCFGBuilder took 245.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:46:13,666 INFO L168 Benchmark]: TraceAbstraction took 3917.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.8 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -745.9 MB). Peak memory consumption was 220.2 MB. Max. memory is 7.1 GB. [2018-12-03 16:46:13,670 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 245.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3917.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.8 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -745.9 MB). Peak memory consumption was 220.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 36]: assertion can be violated assertion can be violated We found a FailurePath: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~x~4, main_~y~4; [L12] main_~x~4 := 0; [L13] main_~y~4 := 1; VAL [main_~x~4=0, main_~y~4=1] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=1, main_~y~4=2] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=2, main_~y~4=4] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=3, main_~y~4=8] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=4, main_~y~4=16] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=5, main_~y~4=32] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=6, main_~y~4=64] [L21] assume !(main_~x~4 % 4294967296 < 6); [L22] __VERIFIER_assert_#in~cond := (if main_~y~4 % 4294967296 != 64 then 1 else 0); [L23] havoc __VERIFIER_assert_~cond; [L24] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L25] assume __VERIFIER_assert_~cond == 0; [L26] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] [L36] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 3.8s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 0 SDslu, 15 SDs, 0 SdLazy, 121 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 2459 SizeOfPredicates, 5 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...