java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:43:04,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:43:04,193 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:43:04,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:43:04,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:43:04,217 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:43:04,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:43:04,222 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:43:04,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:43:04,226 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:43:04,226 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:43:04,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:43:04,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:43:04,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:43:04,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:43:04,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:43:04,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:43:04,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:43:04,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:43:04,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:43:04,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:43:04,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:43:04,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:43:04,263 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:43:04,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:43:04,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:43:04,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:43:04,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:43:04,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:43:04,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:43:04,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:43:04,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:43:04,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:43:04,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:43:04,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:43:04,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:43:04,277 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-04 11:43:04,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:43:04,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:43:04,301 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:43:04,302 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:43:04,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:43:04,302 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:43:04,303 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:43:04,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:43:04,303 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-04 11:43:04,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:43:04,303 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-04 11:43:04,304 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-04 11:43:04,304 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:43:04,304 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:43:04,304 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:43:04,306 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:43:04,306 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:43:04,307 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:43:04,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:43:04,307 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:43:04,307 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:43:04,307 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:43:04,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:43:04,309 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:43:04,309 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:43:04,310 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:43:04,310 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:43:04,310 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:43:04,310 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:43:04,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:43:04,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:43:04,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:43:04,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:43:04,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:43:04,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:43:04,312 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:43:04,312 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:43:04,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:43:04,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:43:04,313 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:43:04,313 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:43:04,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:43:04,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:43:04,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:43:04,388 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:43:04,389 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:43:04,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-12-04 11:43:04,390 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-12-04 11:43:04,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:43:04,446 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:43:04,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:43:04,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:43:04,448 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:43:04,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,488 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-04 11:43:04,489 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-04 11:43:04,489 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-04 11:43:04,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:43:04,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:43:04,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:43:04,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:43:04,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... [2018-12-04 11:43:04,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:43:04,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:43:04,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:43:04,526 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:43:04,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:43:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-04 11:43:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-04 11:43:04,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-04 11:43:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-04 11:43:04,874 INFO L272 CfgBuilder]: Using library mode [2018-12-04 11:43:04,874 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-04 11:43:04,875 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:43:04 BoogieIcfgContainer [2018-12-04 11:43:04,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:43:04,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:43:04,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:43:04,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:43:04,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:04" (1/2) ... [2018-12-04 11:43:04,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a67464 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:43:04, skipping insertion in model container [2018-12-04 11:43:04,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:43:04" (2/2) ... [2018-12-04 11:43:04,896 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-12-04 11:43:04,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:43:04,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-04 11:43:04,977 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-04 11:43:05,016 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:43:05,017 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:43:05,017 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:43:05,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:43:05,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:43:05,018 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:43:05,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:43:05,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:43:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-12-04 11:43:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:43:05,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:43:05,049 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-04 11:43:05,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,058 INFO L82 PathProgramCache]: Analyzing trace with hash 927591, now seen corresponding path program 1 times [2018-12-04 11:43:05,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:43:05,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-04 11:43:05,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:43:05,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:43:05,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:43:05,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:43:05,238 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-12-04 11:43:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:05,284 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-12-04 11:43:05,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:43:05,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:43:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:05,302 INFO L225 Difference]: With dead ends: 14 [2018-12-04 11:43:05,302 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:43:05,306 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-04 11:43:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:43:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:43:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:43:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-04 11:43:05,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-04 11:43:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:05,354 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-04 11:43:05,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:43:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-04 11:43:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:43:05,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:43:05,356 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-04 11:43:05,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash 927592, now seen corresponding path program 1 times [2018-12-04 11:43:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,662 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-12-04 11:43:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:43:05,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-04 11:43:05,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:43:05,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:43:05,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:43:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:43:05,669 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2018-12-04 11:43:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:05,728 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-04 11:43:05,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:43:05,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:43:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:05,730 INFO L225 Difference]: With dead ends: 13 [2018-12-04 11:43:05,730 INFO L226 Difference]: Without dead ends: 12 [2018-12-04 11:43:05,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:43:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-04 11:43:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-12-04 11:43:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-04 11:43:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-04 11:43:05,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 4 [2018-12-04 11:43:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:05,735 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-04 11:43:05,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:43:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-04 11:43:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-04 11:43:05,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,736 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-04 11:43:05,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-04 11:43:05,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1869902812, now seen corresponding path program 1 times [2018-12-04 11:43:05,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:43:05,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-04 11:43:05,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:43:05,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:43:05,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:43:05,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:43:05,785 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 3 states. [2018-12-04 11:43:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:05,814 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-04 11:43:05,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:43:05,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-04 11:43:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:05,816 INFO L225 Difference]: With dead ends: 17 [2018-12-04 11:43:05,816 INFO L226 Difference]: Without dead ends: 10 [2018-12-04 11:43:05,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:43:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-04 11:43:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-04 11:43:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-04 11:43:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-04 11:43:05,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-04 11:43:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:05,821 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-04 11:43:05,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:43:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-04 11:43:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:43:05,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,822 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-04 11:43:05,822 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-04 11:43:05,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 342113753, now seen corresponding path program 1 times [2018-12-04 11:43:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,977 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-04 11:43:05,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:05,979 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-04 11:43:05,981 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [19] [2018-12-04 11:43:06,017 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:43:06,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:43:06,053 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.visit(NonrelationalStatementProcessor.java:470) at de.uni_freiburg.informatik.ultimate.boogie.BoogieVisitor.processExpression(BoogieVisitor.java:373) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processExpression(NonrelationalStatementProcessor.java:221) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpressions(BoogieTransformer.java:662) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:389) at de.uni_freiburg.informatik.ultimate.boogie.BoogieVisitor.processStatement(BoogieVisitor.java:214) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:200) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:176) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:145) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:364) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:127) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-12-04 11:43:06,057 INFO L168 Benchmark]: Toolchain (without parser) took 1611.39 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-12-04 11:43:06,058 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:43:06,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:43:06,059 INFO L168 Benchmark]: Boogie Preprocessor took 31.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:43:06,060 INFO L168 Benchmark]: RCFGBuilder took 349.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-04 11:43:06,061 INFO L168 Benchmark]: TraceAbstraction took 1174.13 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-04 11:43:06,065 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.82 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 31.61 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 349.49 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 1174.13 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...