java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:12:40,126 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:12:40,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:12:40,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:12:40,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:12:40,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:12:40,143 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:12:40,145 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:12:40,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:12:40,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:12:40,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:12:40,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:12:40,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:12:40,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:12:40,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:12:40,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:12:40,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:12:40,155 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:12:40,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:12:40,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:12:40,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:12:40,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:12:40,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:12:40,163 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:12:40,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:12:40,165 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:12:40,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:12:40,166 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:12:40,167 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:12:40,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:12:40,168 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:12:40,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:12:40,169 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:12:40,170 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:12:40,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:12:40,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:12:40,172 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 [2019-02-15 11:12:40,185 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:12:40,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:12:40,188 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:12:40,188 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:12:40,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:12:40,188 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:12:40,188 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:12:40,189 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:12:40,189 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:12:40,190 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:12:40,190 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:12:40,190 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:12:40,190 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:12:40,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:12:40,191 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:12:40,191 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:12:40,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:12:40,192 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:12:40,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:12:40,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:12:40,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:12:40,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:12:40,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:12:40,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:12:40,194 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:12:40,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:12:40,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:12:40,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:12:40,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:12:40,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:12:40,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:12:40,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:12:40,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:12:40,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:12:40,197 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:12:40,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:12:40,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:12:40,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:12:40,197 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:12:40,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:12:40,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:12:40,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:12:40,254 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:12:40,254 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:12:40,255 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-02-15 11:12:40,255 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-02-15 11:12:40,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:12:40,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:12:40,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:12:40,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:12:40,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:12:40,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,349 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-15 11:12:40,350 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-15 11:12:40,350 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-15 11:12:40,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:12:40,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:12:40,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:12:40,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:12:40,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/1) ... [2019-02-15 11:12:40,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:12:40,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:12:40,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:12:40,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:12:40,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (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 [2019-02-15 11:12:40,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-02-15 11:12:40,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-15 11:12:40,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-15 11:12:40,480 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-15 11:12:40,819 INFO L278 CfgBuilder]: Using library mode [2019-02-15 11:12:40,819 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-15 11:12:40,821 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:12:40 BoogieIcfgContainer [2019-02-15 11:12:40,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:12:40,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:12:40,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:12:40,826 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:12:40,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:40" (1/2) ... [2019-02-15 11:12:40,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272f3938 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:12:40, skipping insertion in model container [2019-02-15 11:12:40,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:12:40" (2/2) ... [2019-02-15 11:12:40,830 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-02-15 11:12:40,840 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:12:40,850 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-15 11:12:40,870 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-15 11:12:40,909 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:12:40,909 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:12:40,909 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:12:40,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:12:40,910 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:12:40,910 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:12:40,910 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:12:40,910 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:12:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-15 11:12:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:12:40,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:40,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:12:40,951 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-15 11:12:40,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:40,961 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-15 11:12:40,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:41,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:41,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:41,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:41,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:12:41,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:12:41,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:12:41,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:12:41,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:12:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:12:41,313 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-02-15 11:12:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:41,453 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-02-15 11:12:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:12:41,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:12:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:41,467 INFO L225 Difference]: With dead ends: 20 [2019-02-15 11:12:41,467 INFO L226 Difference]: Without dead ends: 10 [2019-02-15 11:12:41,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:12:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-15 11:12:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-02-15 11:12:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 11:12:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-15 11:12:41,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-15 11:12:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:41,510 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-15 11:12:41,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:12:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-15 11:12:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:12:41,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:41,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:12:41,511 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-15 11:12:41,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:41,512 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-02-15 11:12:41,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:41,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:41,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:41,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:12:41,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:12:41,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:12:41,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:12:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:12:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:12:41,859 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-02-15 11:12:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:42,208 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-02-15 11:12:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:12:42,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-15 11:12:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:42,210 INFO L225 Difference]: With dead ends: 17 [2019-02-15 11:12:42,210 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:12:42,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:12:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:12:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-02-15 11:12:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 11:12:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-02-15 11:12:42,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-02-15 11:12:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:42,218 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-02-15 11:12:42,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:12:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-02-15 11:12:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 11:12:42,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:42,220 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-15 11:12:42,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-15 11:12:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:42,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-02-15 11:12:42,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:42,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:42,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:42,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:42,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:42,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:12:42,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:12:42,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:12:42,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:12:42,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:12:42,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:12:42,271 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-02-15 11:12:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:42,340 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-02-15 11:12:42,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:12:42,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-02-15 11:12:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:42,343 INFO L225 Difference]: With dead ends: 18 [2019-02-15 11:12:42,343 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 11:12:42,344 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 [2019-02-15 11:12:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 11:12:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-15 11:12:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 11:12:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-15 11:12:42,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-02-15 11:12:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:42,351 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-15 11:12:42,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:12:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-15 11:12:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 11:12:42,354 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:42,354 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-02-15 11:12:42,355 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-15 11:12:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:42,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-02-15 11:12:42,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:42,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:42,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:42,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:42,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:42,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:42,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:42,584 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-15 11:12:42,586 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-02-15 11:12:42,645 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:12:42,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:12:44,738 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.util.datastructures.UnionFind.union(UnionFind.java:445) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.SegmentationMap.move(SegmentationMap.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainState.addEquivalence(ArrayDomainState.java:736) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainState.unify(ArrayDomainState.java:563) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainState.isSubsetOf(ArrayDomainState.java:950) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainState.isSubsetOf(ArrayDomainState.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.getMaximalElements(DisjunctiveAbstractState.java:571) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.reduce(DisjunctiveAbstractState.java:548) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:521) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) 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:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:382) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2019-02-15 11:12:44,744 INFO L168 Benchmark]: Toolchain (without parser) took 4445.24 ms. Allocated memory was 141.0 MB in the beginning and 318.8 MB in the end (delta: 177.7 MB). Free memory was 108.1 MB in the beginning and 153.8 MB in the end (delta: -45.7 MB). Peak memory consumption was 132.0 MB. Max. memory is 7.1 GB. [2019-02-15 11:12:44,746 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:12:44,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.32 ms. Allocated memory is still 141.0 MB. Free memory was 108.1 MB in the beginning and 105.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-15 11:12:44,750 INFO L168 Benchmark]: Boogie Preprocessor took 27.21 ms. Allocated memory is still 141.0 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:12:44,751 INFO L168 Benchmark]: RCFGBuilder took 422.41 ms. Allocated memory is still 141.0 MB. Free memory was 104.5 MB in the beginning and 93.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:12:44,752 INFO L168 Benchmark]: TraceAbstraction took 3920.94 ms. Allocated memory was 141.0 MB in the beginning and 318.8 MB in the end (delta: 177.7 MB). Free memory was 92.8 MB in the beginning and 153.8 MB in the end (delta: -61.0 MB). Peak memory consumption was 116.7 MB. Max. memory is 7.1 GB. [2019-02-15 11:12:44,759 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.21 ms. Allocated memory is still 141.0 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.32 ms. Allocated memory is still 141.0 MB. Free memory was 108.1 MB in the beginning and 105.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.21 ms. Allocated memory is still 141.0 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 422.41 ms. Allocated memory is still 141.0 MB. Free memory was 104.5 MB in the beginning and 93.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3920.94 ms. Allocated memory was 141.0 MB in the beginning and 318.8 MB in the end (delta: 177.7 MB). Free memory was 92.8 MB in the beginning and 153.8 MB in the end (delta: -61.0 MB). Peak memory consumption was 116.7 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...