java -ea -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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:31:09,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:31:09,537 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:31:09,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:31:09,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:31:09,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:31:09,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:31:09,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:31:09,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:31:09,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:31:09,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:31:09,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:31:09,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:31:09,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:31:09,577 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:31:09,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:31:09,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:31:09,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:31:09,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:31:09,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:31:09,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:31:09,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:31:09,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:31:09,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:31:09,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:31:09,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:31:09,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:31:09,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:31:09,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:31:09,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:31:09,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:31:09,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:31:09,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:31:09,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:31:09,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:31:09,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:31:09,615 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-18 22:31:09,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:31:09,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:31:09,639 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:31:09,639 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:31:09,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:31:09,640 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:31:09,640 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:31:09,640 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:31:09,641 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:31:09,641 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-18 22:31:09,641 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-18 22:31:09,641 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:31:09,641 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:31:09,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:31:09,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:31:09,642 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:31:09,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:31:09,644 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:31:09,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:31:09,644 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:31:09,644 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:31:09,645 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:31:09,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:31:09,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:31:09,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:31:09,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:31:09,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:31:09,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:31:09,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:31:09,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:31:09,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:31:09,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:31:09,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:31:09,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:31:09,649 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:31:09,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:31:09,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:31:09,649 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:31:09,650 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:31:09,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:31:09,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:31:09,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:31:09,727 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:31:09,727 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:31:09,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2018-12-18 22:31:09,728 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2018-12-18 22:31:09,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:31:09,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:31:09,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:31:09,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:31:09,772 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:31:09,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:31:09,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:31:09,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:31:09,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:31:09,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/1) ... [2018-12-18 22:31:09,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:31:09,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:31:09,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:31:09,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:31:09,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31: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-18 22:31:09,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:31:09,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:31:10,484 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:31:10,485 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-18 22:31:10,485 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:31:10 BoogieIcfgContainer [2018-12-18 22:31:10,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:31:10,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:31:10,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:31:10,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:31:10,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:31:09" (1/2) ... [2018-12-18 22:31:10,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700bb8ba and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:31:10, skipping insertion in model container [2018-12-18 22:31:10,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:31:10" (2/2) ... [2018-12-18 22:31:10,494 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2018-12-18 22:31:10,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:31:10,513 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-18 22:31:10,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-18 22:31:10,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:31:10,569 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:31:10,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:31:10,569 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:31:10,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:31:10,570 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:31:10,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:31:10,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:31:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-18 22:31:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:31:10,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:31:10,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:31:10,601 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:31:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:31:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2018-12-18 22:31:10,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:31:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:10,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:31:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:10,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:31:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:31:10,849 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:31:10,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {13#false} is VALID [2018-12-18 22:31:10,867 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-18 22:31:10,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:31:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:31:10,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:31:10,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:31:10,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:31:10,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:31:10,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:10,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:31:10,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:31:10,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:31:10,917 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-18 22:31:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:11,186 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-18 22:31:11,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:31:11,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:31:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:31:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:31:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-12-18 22:31:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:31:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-12-18 22:31:11,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2018-12-18 22:31:11,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:11,362 INFO L225 Difference]: With dead ends: 17 [2018-12-18 22:31:11,362 INFO L226 Difference]: Without dead ends: 12 [2018-12-18 22:31:11,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-18 22:31:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-18 22:31:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-12-18 22:31:11,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:31:11,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2018-12-18 22:31:11,435 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2018-12-18 22:31:11,435 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2018-12-18 22:31:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:11,439 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-18 22:31:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-12-18 22:31:11,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:11,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:11,440 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2018-12-18 22:31:11,440 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2018-12-18 22:31:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:11,446 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-18 22:31:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-12-18 22:31:11,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:11,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:11,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:31:11,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:31:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-18 22:31:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-18 22:31:11,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2018-12-18 22:31:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:31:11,457 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-18 22:31:11,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:31:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-18 22:31:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:31:11,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:31:11,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:31:11,458 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:31:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:31:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2018-12-18 22:31:11,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:31:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:31:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:11,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:31:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:31:11,538 INFO L273 TraceCheckUtils]: 0: Hoare triple {70#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 22:31:11,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] <= 0; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 22:31:11,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] >= 0); {71#false} is VALID [2018-12-18 22:31:11,572 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-18 22:31:11,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:31:11,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:31:11,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:31:11,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:31:11,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:31:11,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:31:11,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:11,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:31:11,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:31:11,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:31:11,610 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2018-12-18 22:31:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:11,685 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-18 22:31:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:31:11,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:31:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:31:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:31:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-18 22:31:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:31:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-18 22:31:11,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2018-12-18 22:31:11,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:11,732 INFO L225 Difference]: With dead ends: 12 [2018-12-18 22:31:11,732 INFO L226 Difference]: Without dead ends: 11 [2018-12-18 22:31:11,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-18 22:31:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-18 22:31:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-18 22:31:11,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:31:11,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2018-12-18 22:31:11,747 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2018-12-18 22:31:11,747 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2018-12-18 22:31:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:11,748 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2018-12-18 22:31:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2018-12-18 22:31:11,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:11,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:11,752 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2018-12-18 22:31:11,752 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2018-12-18 22:31:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:11,754 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2018-12-18 22:31:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2018-12-18 22:31:11,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:11,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:11,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:31:11,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:31:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-18 22:31:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-12-18 22:31:11,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2018-12-18 22:31:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:31:11,759 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-12-18 22:31:11,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:31:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2018-12-18 22:31:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:31:11,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:31:11,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:31:11,765 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:31:11,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:31:11,765 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2018-12-18 22:31:11,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:31:11,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:11,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:31:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:11,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:31:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:31:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:31:11,828 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-18 22:31:11,845 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:31:11,845 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-12-18 22:31:11,845 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-12-18 22:31:11,845 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-12-18 22:31:11,845 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-12-18 22:31:11,846 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-12-18 22:31:11,846 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-12-18 22:31:11,846 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-12-18 22:31:11,846 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-12-18 22:31:11,846 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-12-18 22:31:11,846 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-18 22:31:11,847 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-18 22:31:11,849 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:31:11 BoogieIcfgContainer [2018-12-18 22:31:11,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:31:11,851 INFO L168 Benchmark]: Toolchain (without parser) took 2081.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-12-18 22:31:11,853 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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-18 22:31:11,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.21 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-18 22:31:11,855 INFO L168 Benchmark]: Boogie Preprocessor took 37.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:31:11,855 INFO L168 Benchmark]: RCFGBuilder took 609.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-18 22:31:11,856 INFO L168 Benchmark]: TraceAbstraction took 1362.47 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-18 22:31:11,860 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 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 66.21 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 37.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 609.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1362.47 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: assertion can be violated assertion can be violated We found a FailurePath: [L44-L45] modifies #valid; [L44-L46] ensures old(#valid)[ptr] == 0; [L44-L47] ensures #valid == old(#valid)[ptr := 1]; [L44-L45] modifies #valid; [L44-L46] ensures old(#valid)[ptr] == 0; [L44-L47] ensures #valid == old(#valid)[ptr := 1]; [L44-L45] modifies #valid; [L44-L46] ensures old(#valid)[ptr] == 0; [L44-L47] ensures #valid == old(#valid)[ptr := 1]; [L21] assume p1 < p2; [L22] assume p2 < p3; [L24] #memory_int[p1] := 0; [L25] #memory_int[p2] := 0; [L26] #memory_int[p3] := 0; [L30] #memory_int[p1] := #memory_int[p1] + 1; [L38] assert #memory_int[p1] <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. UNSAFE Result, 1.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 8 SDslu, 1 SDs, 0 SdLazy, 31 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...