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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb97592 [2018-12-19 21:20:15,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 21:20:15,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 21:20:15,645 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 21:20:15,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 21:20:15,648 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 21:20:15,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 21:20:15,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 21:20:15,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 21:20:15,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 21:20:15,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 21:20:15,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 21:20:15,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 21:20:15,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 21:20:15,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 21:20:15,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 21:20:15,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 21:20:15,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 21:20:15,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 21:20:15,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 21:20:15,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 21:20:15,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 21:20:15,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 21:20:15,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 21:20:15,683 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 21:20:15,684 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 21:20:15,684 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 21:20:15,685 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 21:20:15,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 21:20:15,688 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 21:20:15,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 21:20:15,689 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 21:20:15,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 21:20:15,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 21:20:15,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 21:20:15,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 21:20:15,694 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-19 21:20:15,718 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 21:20:15,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 21:20:15,720 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 21:20:15,720 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 21:20:15,720 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 21:20:15,720 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 21:20:15,720 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 21:20:15,721 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 21:20:15,721 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-19 21:20:15,722 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 21:20:15,722 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-19 21:20:15,722 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-19 21:20:15,722 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 21:20:15,722 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 21:20:15,724 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 21:20:15,724 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 21:20:15,724 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 21:20:15,724 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 21:20:15,725 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 21:20:15,725 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 21:20:15,725 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 21:20:15,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 21:20:15,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 21:20:15,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 21:20:15,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 21:20:15,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 21:20:15,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 21:20:15,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 21:20:15,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 21:20:15,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 21:20:15,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 21:20:15,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 21:20:15,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 21:20:15,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 21:20:15,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 21:20:15,730 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 21:20:15,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 21:20:15,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 21:20:15,731 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 21:20:15,731 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 21:20:15,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 21:20:15,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 21:20:15,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 21:20:15,813 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 21:20:15,814 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 21:20:15,814 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl [2018-12-19 21:20:15,815 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl' [2018-12-19 21:20:15,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 21:20:15,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 21:20:15,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 21:20:15,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 21:20:15,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 21:20:15,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 21:20:15,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 21:20:15,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 21:20:15,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 21:20:15,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/1) ... [2018-12-19 21:20:15,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 21:20:15,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 21:20:15,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 21:20:15,964 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 21:20:15,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (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-19 21:20:16,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-19 21:20:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-19 21:20:16,304 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-19 21:20:16,305 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-19 21:20:16,305 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 09:20:16 BoogieIcfgContainer [2018-12-19 21:20:16,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 21:20:16,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 21:20:16,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 21:20:16,310 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 21:20:16,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 09:20:15" (1/2) ... [2018-12-19 21:20:16,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364f23a9 and model type speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 09:20:16, skipping insertion in model container [2018-12-19 21:20:16,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 09:20:16" (2/2) ... [2018-12-19 21:20:16,314 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-1-unlimited.bpl [2018-12-19 21:20:16,324 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 21:20:16,332 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-19 21:20:16,351 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-19 21:20:16,384 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 21:20:16,385 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 21:20:16,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 21:20:16,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 21:20:16,385 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 21:20:16,385 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 21:20:16,386 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 21:20:16,386 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 21:20:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-19 21:20:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-19 21:20:16,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:20:16,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-19 21:20:16,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:20:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:20:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-12-19 21:20:16,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:20:16,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:20:16,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:20:16,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:20:16,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:20:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:20:16,674 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} havoc main_p1;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;#memory_int := #memory_int[main_p1 := 0]; {10#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 21:20:16,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {9#false} is VALID [2018-12-19 21:20:16,699 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-19 21:20:16,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 21:20:16,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 21:20:16,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 21:20:16,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 21:20:16,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:20:16,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 21:20:16,750 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-19 21:20:16,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 21:20:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 21:20:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 21:20:16,766 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-19 21:20:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:20:16,965 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-19 21:20:16,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 21:20:16,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 21:20:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:20:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 21:20:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-19 21:20:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 21:20:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-19 21:20:16,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2018-12-19 21:20:17,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 21:20:17,036 INFO L225 Difference]: With dead ends: 9 [2018-12-19 21:20:17,036 INFO L226 Difference]: Without dead ends: 4 [2018-12-19 21:20:17,040 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-19 21:20:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-12-19 21:20:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-12-19 21:20:17,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:20:17,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4 states. Second operand 4 states. [2018-12-19 21:20:17,110 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2018-12-19 21:20:17,111 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2018-12-19 21:20:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:20:17,112 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2018-12-19 21:20:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-19 21:20:17,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:20:17,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:20:17,113 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2018-12-19 21:20:17,113 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2018-12-19 21:20:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:20:17,115 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2018-12-19 21:20:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-19 21:20:17,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:20:17,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:20:17,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:20:17,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:20:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:20:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-19 21:20:17,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-12-19 21:20:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:20:17,119 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-12-19 21:20:17,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 21:20:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-19 21:20:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 21:20:17,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 21:20:17,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 21:20:17,120 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 21:20:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:20:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-12-19 21:20:17,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 21:20:17,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:20:17,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:20:17,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 21:20:17,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 21:20:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:20:17,271 INFO L273 TraceCheckUtils]: 0: Hoare triple {38#true} havoc main_p1;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;#memory_int := #memory_int[main_p1 := 0]; {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 21:20:17,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {41#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 21:20:17,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {39#false} is VALID [2018-12-19 21:20:17,282 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-19 21:20:17,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:20:17,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 21:20:17,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 21:20:17,285 INFO L207 CegarAbsIntRunner]: [0], [4], [6] [2018-12-19 21:20:17,323 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 21:20:17,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 21:20:17,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 21:20:17,415 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 14 root evaluator evaluations with a maximum evaluation depth of 2. Performed 14 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 21:20:17,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 21:20:17,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 21:20:17,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 21:20:17,422 INFO L193 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-19 21:20:17,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 21:20:17,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 21:20:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:20:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 21:20:17,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 21:20:17,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-19 21:20:17,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:20:17,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:20:17,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-19 21:20:17,602 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:20:17,603 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_7|]. (= |#memory_int| (store |v_#memory_int_7| ULTIMATE.start_main_p1 0)) [2018-12-19 21:20:17,603 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2018-12-19 21:20:17,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 21:20:17,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-19 21:20:17,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 21:20:17,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 21:20:17,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-19 21:20:17,687 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 21:20:17,688 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|]. (let ((.cse0 (select |v_#memory_int_8| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_8| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2018-12-19 21:20:17,688 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2018-12-19 21:20:17,779 INFO L273 TraceCheckUtils]: 0: Hoare triple {38#true} havoc main_p1;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;#memory_int := #memory_int[main_p1 := 0]; {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 21:20:17,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {48#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2018-12-19 21:20:17,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} assume !(#memory_int[main_p1] >= 0); {39#false} is VALID [2018-12-19 21:20:17,782 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-19 21:20:17,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 21:20:18,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {39#false} is VALID [2018-12-19 21:20:18,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {52#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 21:20:18,065 INFO L273 TraceCheckUtils]: 0: Hoare triple {38#true} havoc main_p1;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;#memory_int := #memory_int[main_p1 := 0]; {56#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2018-12-19 21:20:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 21:20:18,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 21:20:18,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-19 21:20:18,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 21:20:18,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 21:20:18,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 21:20:18,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 21:20:18,099 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-19 21:20:18,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 21:20:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 21:20:18,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 21:20:18,101 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-12-19 21:20:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:20:18,167 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2018-12-19 21:20:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 21:20:18,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 21:20:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 21:20:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:20:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-12-19 21:20:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 21:20:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-12-19 21:20:18,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3 transitions. [2018-12-19 21:20:18,175 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-19 21:20:18,175 INFO L225 Difference]: With dead ends: 4 [2018-12-19 21:20:18,176 INFO L226 Difference]: Without dead ends: 0 [2018-12-19 21:20:18,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 21:20:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-19 21:20:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-19 21:20:18,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 21:20:18,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-19 21:20:18,179 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 21:20:18,179 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 21:20:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:20:18,180 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 21:20:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 21:20:18,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:20:18,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:20:18,181 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 21:20:18,181 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 21:20:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 21:20:18,181 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 21:20:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 21:20:18,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:20:18,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 21:20:18,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 21:20:18,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 21:20:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-19 21:20:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-19 21:20:18,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2018-12-19 21:20:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 21:20:18,183 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-19 21:20:18,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 21:20:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 21:20:18,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 21:20:18,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-19 21:20:18,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-19 21:20:18,234 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 28) no Hoare annotation was computed. [2018-12-19 21:20:18,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-19 21:20:18,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 26) no Hoare annotation was computed. [2018-12-19 21:20:18,235 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 24) the Hoare annotation is: (<= 0 (select |#memory_int| ULTIMATE.start_main_p1)) [2018-12-19 21:20:18,236 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-19 21:20:18,242 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-19 21:20:18,242 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-19 21:20:18,242 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-19 21:20:18,242 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-19 21:20:18,248 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 09:20:18 BoogieIcfgContainer [2018-12-19 21:20:18,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-19 21:20:18,250 INFO L168 Benchmark]: Toolchain (without parser) took 2381.79 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: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. [2018-12-19 21:20:18,252 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-19 21:20:18,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.00 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-19 21:20:18,253 INFO L168 Benchmark]: Boogie Preprocessor took 25.92 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-19 21:20:18,253 INFO L168 Benchmark]: RCFGBuilder took 341.54 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-19 21:20:18,254 INFO L168 Benchmark]: TraceAbstraction took 1941.93 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: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2018-12-19 21:20:18,258 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.20 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.00 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 25.92 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 341.54 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 1941.93 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: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 <= #memory_int[p1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 1.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 5 HoareAnnotationTreeSize, 1 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 69 SizeOfPredicates, 0 NumberOfNonLiveVariables, 11 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...