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/heapseparator/speedup-poc-dd-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 10:07:36,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 10:07:36,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 10:07:36,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 10:07:36,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 10:07:36,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 10:07:36,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 10:07:36,234 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 10:07:36,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 10:07:36,236 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 10:07:36,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 10:07:36,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 10:07:36,238 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 10:07:36,242 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 10:07:36,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 10:07:36,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 10:07:36,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 10:07:36,253 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 10:07:36,255 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 10:07:36,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 10:07:36,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 10:07:36,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 10:07:36,262 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 10:07:36,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 10:07:36,263 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 10:07:36,264 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 10:07:36,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 10:07:36,265 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 10:07:36,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 10:07:36,267 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 10:07:36,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 10:07:36,268 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 10:07:36,269 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 10:07:36,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 10:07:36,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 10:07:36,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 10:07:36,271 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-18 10:07:36,283 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 10:07:36,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 10:07:36,285 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 10:07:36,285 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 10:07:36,285 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 10:07:36,285 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 10:07:36,285 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 10:07:36,286 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 10:07:36,286 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 10:07:36,286 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 10:07:36,286 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 10:07:36,287 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 10:07:36,287 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 10:07:36,287 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 10:07:36,288 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 10:07:36,288 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 10:07:36,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 10:07:36,288 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 10:07:36,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 10:07:36,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 10:07:36,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 10:07:36,289 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 10:07:36,289 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 10:07:36,290 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 10:07:36,290 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 10:07:36,290 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 10:07:36,290 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 10:07:36,290 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 10:07:36,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 10:07:36,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 10:07:36,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:07:36,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 10:07:36,291 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 10:07:36,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 10:07:36,292 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 10:07:36,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 10:07:36,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 10:07:36,292 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 10:07:36,293 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 10:07:36,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 10:07:36,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 10:07:36,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 10:07:36,362 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 10:07:36,363 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 10:07:36,364 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-02-18 10:07:36,364 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-02-18 10:07:36,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 10:07:36,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 10:07:36,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 10:07:36,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 10:07:36,406 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 10:07:36,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 10:07:36,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 10:07:36,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 10:07:36,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 10:07:36,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/1) ... [2019-02-18 10:07:36,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 10:07:36,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 10:07:36,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 10:07:36,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 10:07:36,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:07:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 10:07:36,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 10:07:37,079 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 10:07:37,080 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-18 10:07:37,081 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:07:37 BoogieIcfgContainer [2019-02-18 10:07:37,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 10:07:37,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 10:07:37,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 10:07:37,085 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 10:07:37,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:36" (1/2) ... [2019-02-18 10:07:37,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625c4de1 and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 10:07:37, skipping insertion in model container [2019-02-18 10:07:37,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:07:37" (2/2) ... [2019-02-18 10:07:37,089 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-02-18 10:07:37,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 10:07:37,105 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-18 10:07:37,119 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-18 10:07:37,148 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 10:07:37,148 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 10:07:37,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 10:07:37,149 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 10:07:37,149 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 10:07:37,149 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 10:07:37,149 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 10:07:37,149 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 10:07:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-18 10:07:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 10:07:37,170 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:37,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 10:07:37,174 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-18 10:07:37,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:37,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:37,372 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-18 10:07:37,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:07:37,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:07:37,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:37,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:37,397 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-18 10:07:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:37,576 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-18 10:07:37,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:37,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 10:07:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:37,592 INFO L225 Difference]: With dead ends: 33 [2019-02-18 10:07:37,593 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 10:07:37,595 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 [2019-02-18 10:07:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 10:07:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-18 10:07:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 10:07:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-18 10:07:37,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-18 10:07:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:37,629 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-18 10:07:37,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-18 10:07:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:37,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:37,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:37,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-18 10:07:37,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:37,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:37,705 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-18 10:07:37,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:07:37,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:07:37,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:37,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:37,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:37,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:37,709 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-18 10:07:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:37,951 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-18 10:07:37,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:37,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:07:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:37,953 INFO L225 Difference]: With dead ends: 28 [2019-02-18 10:07:37,953 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 10:07:37,955 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 [2019-02-18 10:07:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 10:07:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-18 10:07:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 10:07:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-18 10:07:37,959 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-18 10:07:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:37,960 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-18 10:07:37,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-18 10:07:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:37,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:37,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:37,961 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:37,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:37,962 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-18 10:07:37,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:37,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:37,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:38,263 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-18 10:07:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:38,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:38,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:38,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:07:38,339 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-18 10:07:38,396 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:38,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:55,167 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 10:07:55,169 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 10:07:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:55,175 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 10:07:55,949 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 10:08:07,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_47 Int) (v_idx_58 Int) (v_idx_56 Int) (v_idx_54 Int) (v_idx_44 Int) (v_idx_52 Int) (v_idx_50 Int) (v_idx_62 Int) (v_idx_60 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p5 2)) (.cse6 (+ c_ULTIMATE.start_main_p3 4)) (.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 5)) (.cse8 (+ c_ULTIMATE.start_main_p5 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 6)) (.cse5 (+ c_ULTIMATE.start_main_p4 3)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse11 (+ c_ULTIMATE.start_main_p3 1)) (.cse7 (+ c_ULTIMATE.start_main_p7 1)) (.cse2 (+ c_ULTIMATE.start_main_p6 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 1))) (and (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p7) (<= .cse0 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p3 3) c_ULTIMATE.start_main_p6) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p7) (or (< v_idx_60 c_ULTIMATE.start_main_p6) (<= .cse2 v_idx_60) (= 0 (select |c_#memory_int| v_idx_60))) (<= .cse3 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (<= .cse5 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p7) (or (<= .cse7 v_idx_47) (< v_idx_47 c_ULTIMATE.start_main_p7) (= 1 (select |c_#valid| v_idx_47))) (<= (+ c_ULTIMATE.start_main_p1 5) c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 4) c_ULTIMATE.start_main_p6) (<= c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (<= .cse8 c_ULTIMATE.start_main_p6) (or (< v_idx_56 c_ULTIMATE.start_main_p4) (let ((.cse9 (select |c_#memory_int| v_idx_56))) (and (<= (* 2 .cse9) 0) (<= .cse9 0))) (<= .cse3 v_idx_56)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_62 c_ULTIMATE.start_main_p7) (<= .cse7 v_idx_62) (= 0 (select |c_#memory_int| v_idx_62))) (<= .cse10 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (<= .cse8 v_idx_58) (< v_idx_58 c_ULTIMATE.start_main_p5) (= 0 (select |c_#memory_int| v_idx_58))) (<= .cse4 c_ULTIMATE.start_main_p7) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (or (< v_idx_54 c_ULTIMATE.start_main_p3) (<= .cse11 v_idx_54) (= 0 (select |c_#memory_int| v_idx_54))) (or (< v_idx_52 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_52)) (<= .cse10 v_idx_52)) (<= .cse11 c_ULTIMATE.start_main_p4) (or (< v_idx_50 c_ULTIMATE.start_main_p1) (<= .cse12 v_idx_50) (= 0 (select |c_#memory_int| v_idx_50))) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_44)) (< v_idx_44 c_ULTIMATE.start_main_p7) (<= .cse7 v_idx_44)) (<= .cse2 c_ULTIMATE.start_main_p7) (<= .cse12 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p4 2) c_ULTIMATE.start_main_p6)))) is different from false [2019-02-18 10:08:18,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_79 Int) (v_idx_68 Int) (v_idx_65 Int) (v_idx_77 Int) (v_idx_75 Int) (v_idx_83 Int) (v_idx_73 Int) (v_idx_81 Int) (v_idx_71 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p5 2)) (.cse9 (+ c_ULTIMATE.start_main_p3 4)) (.cse2 (+ c_ULTIMATE.start_main_p5 1)) (.cse4 (+ c_ULTIMATE.start_main_p2 5)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p7 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 6)) (.cse8 (+ c_ULTIMATE.start_main_p4 3)) (.cse1 (+ c_ULTIMATE.start_main_p6 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 1)) (.cse11 (+ c_ULTIMATE.start_main_p3 1)) (.cse5 (+ c_ULTIMATE.start_main_p4 1))) (and (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p7) (<= .cse0 c_ULTIMATE.start_main_p7) (or (< v_idx_81 c_ULTIMATE.start_main_p6) (= 0 (select |c_#memory_int| v_idx_81)) (<= .cse1 v_idx_81)) (<= (+ c_ULTIMATE.start_main_p3 3) c_ULTIMATE.start_main_p6) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_79) 0) (< v_idx_79 c_ULTIMATE.start_main_p5) (<= .cse2 v_idx_79)) (or (<= .cse3 v_idx_68) (< v_idx_68 c_ULTIMATE.start_main_p7) (= 1 (select |c_#valid| v_idx_68))) (<= .cse4 c_ULTIMATE.start_main_p7) (<= .cse5 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (<= .cse6 v_idx_71) (= 0 (select |c_#memory_int| v_idx_71)) (< v_idx_71 c_ULTIMATE.start_main_p1)) (or (<= .cse3 v_idx_65) (< v_idx_65 c_ULTIMATE.start_main_p7) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_65))) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (<= .cse8 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse9 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p1 5) c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 4) c_ULTIMATE.start_main_p6) (<= c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_73) 0) (<= .cse10 v_idx_73) (< v_idx_73 c_ULTIMATE.start_main_p2)) (<= .cse9 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (<= .cse10 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (= 0 (select |c_#memory_int| v_idx_83)) (< v_idx_83 c_ULTIMATE.start_main_p7) (<= .cse3 v_idx_83)) (<= .cse7 c_ULTIMATE.start_main_p7) (<= .cse8 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse11 c_ULTIMATE.start_main_p4) (<= .cse1 c_ULTIMATE.start_main_p7) (<= .cse6 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p4 2) c_ULTIMATE.start_main_p6) (or (< v_idx_75 c_ULTIMATE.start_main_p3) (<= .cse11 v_idx_75) (= (select |c_#memory_int| v_idx_75) 0)) (or (< v_idx_77 c_ULTIMATE.start_main_p4) (<= .cse5 v_idx_77) (let ((.cse12 (select |c_#memory_int| v_idx_77))) (and (<= (* 2 .cse12) 0) (<= .cse12 0))))))) is different from false [2019-02-18 10:08:18,245 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-18 10:08:18,245 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 10:08:18,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 10:08:18,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-18 10:08:18,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:18,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:08:18,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:08:18,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-02-18 10:08:18,249 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 4 states. [2019-02-18 10:08:29,294 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_47 Int) (v_idx_58 Int) (v_idx_56 Int) (v_idx_54 Int) (v_idx_44 Int) (v_idx_52 Int) (v_idx_50 Int) (v_idx_62 Int) (v_idx_60 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p5 2)) (.cse6 (+ c_ULTIMATE.start_main_p3 4)) (.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 5)) (.cse8 (+ c_ULTIMATE.start_main_p5 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 6)) (.cse5 (+ c_ULTIMATE.start_main_p4 3)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse11 (+ c_ULTIMATE.start_main_p3 1)) (.cse7 (+ c_ULTIMATE.start_main_p7 1)) (.cse2 (+ c_ULTIMATE.start_main_p6 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 1))) (and (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p7) (<= .cse0 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p3 3) c_ULTIMATE.start_main_p6) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p7) (or (< v_idx_60 c_ULTIMATE.start_main_p6) (<= .cse2 v_idx_60) (= 0 (select |c_#memory_int| v_idx_60))) (<= .cse3 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (<= .cse5 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p7) (or (<= .cse7 v_idx_47) (< v_idx_47 c_ULTIMATE.start_main_p7) (= 1 (select |c_#valid| v_idx_47))) (<= (+ c_ULTIMATE.start_main_p1 5) c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 4) c_ULTIMATE.start_main_p6) (<= c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (<= .cse8 c_ULTIMATE.start_main_p6) (or (< v_idx_56 c_ULTIMATE.start_main_p4) (let ((.cse9 (select |c_#memory_int| v_idx_56))) (and (<= (* 2 .cse9) 0) (<= .cse9 0))) (<= .cse3 v_idx_56)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_62 c_ULTIMATE.start_main_p7) (<= .cse7 v_idx_62) (= 0 (select |c_#memory_int| v_idx_62))) (<= .cse10 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (<= .cse8 v_idx_58) (< v_idx_58 c_ULTIMATE.start_main_p5) (= 0 (select |c_#memory_int| v_idx_58))) (<= .cse4 c_ULTIMATE.start_main_p7) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (or (< v_idx_54 c_ULTIMATE.start_main_p3) (<= .cse11 v_idx_54) (= 0 (select |c_#memory_int| v_idx_54))) (or (< v_idx_52 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_52)) (<= .cse10 v_idx_52)) (<= .cse11 c_ULTIMATE.start_main_p4) (or (< v_idx_50 c_ULTIMATE.start_main_p1) (<= .cse12 v_idx_50) (= 0 (select |c_#memory_int| v_idx_50))) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_44)) (< v_idx_44 c_ULTIMATE.start_main_p7) (<= .cse7 v_idx_44)) (<= .cse2 c_ULTIMATE.start_main_p7) (<= .cse12 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p4 2) c_ULTIMATE.start_main_p6)))) (forall ((v_idx_79 Int) (v_idx_68 Int) (v_idx_65 Int) (v_idx_77 Int) (v_idx_75 Int) (v_idx_83 Int) (v_idx_73 Int) (v_idx_81 Int) (v_idx_71 Int)) (let ((.cse13 (+ c_ULTIMATE.start_main_p5 2)) (.cse22 (+ c_ULTIMATE.start_main_p3 4)) (.cse15 (+ c_ULTIMATE.start_main_p5 1)) (.cse17 (+ c_ULTIMATE.start_main_p2 5)) (.cse23 (+ c_ULTIMATE.start_main_p2 1)) (.cse16 (+ c_ULTIMATE.start_main_p7 1)) (.cse20 (+ c_ULTIMATE.start_main_p1 6)) (.cse21 (+ c_ULTIMATE.start_main_p4 3)) (.cse14 (+ c_ULTIMATE.start_main_p6 1)) (.cse19 (+ c_ULTIMATE.start_main_p1 1)) (.cse24 (+ c_ULTIMATE.start_main_p3 1)) (.cse18 (+ c_ULTIMATE.start_main_p4 1))) (and (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p7) (<= .cse13 c_ULTIMATE.start_main_p7) (or (< v_idx_81 c_ULTIMATE.start_main_p6) (= 0 (select |c_#memory_int| v_idx_81)) (<= .cse14 v_idx_81)) (<= (+ c_ULTIMATE.start_main_p3 3) c_ULTIMATE.start_main_p6) (<= .cse13 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_79) 0) (< v_idx_79 c_ULTIMATE.start_main_p5) (<= .cse15 v_idx_79)) (or (<= .cse16 v_idx_68) (< v_idx_68 c_ULTIMATE.start_main_p7) (= 1 (select |c_#valid| v_idx_68))) (<= .cse17 c_ULTIMATE.start_main_p7) (<= .cse18 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (<= .cse19 v_idx_71) (= 0 (select |c_#memory_int| v_idx_71)) (< v_idx_71 c_ULTIMATE.start_main_p1)) (or (<= .cse16 v_idx_65) (< v_idx_65 c_ULTIMATE.start_main_p7) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_65))) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse22 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p1 5) c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 4) c_ULTIMATE.start_main_p6) (<= c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) (<= .cse14 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_73) 0) (<= .cse23 v_idx_73) (< v_idx_73 c_ULTIMATE.start_main_p2)) (<= .cse22 c_ULTIMATE.start_malloc_ptr) (<= .cse15 c_ULTIMATE.start_main_p6) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= .cse23 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (= 0 (select |c_#memory_int| v_idx_83)) (< v_idx_83 c_ULTIMATE.start_main_p7) (<= .cse16 v_idx_83)) (<= .cse20 c_ULTIMATE.start_main_p7) (<= .cse21 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse24 c_ULTIMATE.start_main_p4) (<= .cse14 c_ULTIMATE.start_main_p7) (<= .cse19 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p4 2) c_ULTIMATE.start_main_p6) (or (< v_idx_75 c_ULTIMATE.start_main_p3) (<= .cse24 v_idx_75) (= (select |c_#memory_int| v_idx_75) 0)) (or (< v_idx_77 c_ULTIMATE.start_main_p4) (<= .cse18 v_idx_77) (let ((.cse25 (select |c_#memory_int| v_idx_77))) (and (<= (* 2 .cse25) 0) (<= .cse25 0)))))))) is different from false [2019-02-18 10:10:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 10:10:15,480 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 1263 column 7: Overflow encountered when expanding vector at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.push(ManagedScript.java:126) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertPostcondInternal(IncrementalHoareTripleChecker.java:525) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertPostcond(IncrementalHoareTripleChecker.java:244) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddPostcond(IncrementalHoareTripleChecker.java:236) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) [2019-02-18 10:10:15,484 INFO L168 Benchmark]: Toolchain (without parser) took 159080.35 ms. Allocated memory was 132.6 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 106.2 MB in the beginning and 869.5 MB in the end (delta: -763.3 MB). Peak memory consumption was 249.1 MB. Max. memory is 7.1 GB. [2019-02-18 10:10:15,486 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory is still 107.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 10:10:15,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.39 ms. Allocated memory is still 132.6 MB. Free memory was 106.2 MB in the beginning and 104.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-18 10:10:15,488 INFO L168 Benchmark]: Boogie Preprocessor took 24.89 ms. Allocated memory is still 132.6 MB. Free memory was 104.1 MB in the beginning and 102.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-18 10:10:15,489 INFO L168 Benchmark]: RCFGBuilder took 596.26 ms. Allocated memory is still 132.6 MB. Free memory was 102.9 MB in the beginning and 90.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-02-18 10:10:15,490 INFO L168 Benchmark]: TraceAbstraction took 158401.79 ms. Allocated memory was 132.6 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 90.0 MB in the beginning and 869.5 MB in the end (delta: -779.5 MB). Peak memory consumption was 232.9 MB. Max. memory is 7.1 GB. [2019-02-18 10:10:15,494 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 132.6 MB. Free memory is still 107.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.39 ms. Allocated memory is still 132.6 MB. Free memory was 106.2 MB in the beginning and 104.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.89 ms. Allocated memory is still 132.6 MB. Free memory was 104.1 MB in the beginning and 102.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 596.26 ms. Allocated memory is still 132.6 MB. Free memory was 102.9 MB in the beginning and 90.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 158401.79 ms. Allocated memory was 132.6 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 90.0 MB in the beginning and 869.5 MB in the end (delta: -779.5 MB). Peak memory consumption was 232.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 1263 column 7: Overflow encountered when expanding vector de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 1263 column 7: Overflow encountered when expanding vector: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...