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-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 18:07:46,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 18:07:46,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 18:07:46,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 18:07:46,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 18:07:46,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 18:07:46,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 18:07:46,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 18:07:46,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 18:07:46,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 18:07:46,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 18:07:46,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 18:07:46,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 18:07:46,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 18:07:46,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 18:07:46,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 18:07:46,047 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 18:07:46,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 18:07:46,054 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 18:07:46,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 18:07:46,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 18:07:46,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 18:07:46,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 18:07:46,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 18:07:46,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 18:07:46,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 18:07:46,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 18:07:46,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 18:07:46,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 18:07:46,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 18:07:46,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 18:07:46,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 18:07:46,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 18:07:46,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 18:07:46,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 18:07:46,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 18:07:46,075 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-01-18 18:07:46,093 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 18:07:46,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 18:07:46,094 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 18:07:46,094 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 18:07:46,095 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 18:07:46,095 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 18:07:46,095 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 18:07:46,095 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 18:07:46,095 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 18:07:46,096 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 18:07:46,096 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 18:07:46,096 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 18:07:46,096 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 18:07:46,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 18:07:46,097 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 18:07:46,097 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 18:07:46,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 18:07:46,098 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 18:07:46,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 18:07:46,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 18:07:46,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 18:07:46,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 18:07:46,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 18:07:46,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 18:07:46,099 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 18:07:46,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 18:07:46,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 18:07:46,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 18:07:46,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 18:07:46,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 18:07:46,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 18:07:46,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 18:07:46,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 18:07:46,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 18:07:46,101 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 18:07:46,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 18:07:46,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 18:07:46,101 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 18:07:46,102 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 18:07:46,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 18:07:46,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 18:07:46,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 18:07:46,151 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 18:07:46,151 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 18:07:46,152 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-01-18 18:07:46,152 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-01-18 18:07:46,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 18:07:46,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 18:07:46,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:46,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 18:07:46,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 18:07:46,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:46,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 18:07:46,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 18:07:46,247 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 18:07:46,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/1) ... [2019-01-18 18:07:46,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 18:07:46,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 18:07:46,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 18:07:46,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 18:07:46,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (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-01-18 18:07:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 18:07:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 18:07:46,621 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 18:07:46,621 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-18 18:07:46,623 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:46 BoogieIcfgContainer [2019-01-18 18:07:46,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 18:07:46,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 18:07:46,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 18:07:46,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 18:07:46,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:46" (1/2) ... [2019-01-18 18:07:46,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfcedc6 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 06:07:46, skipping insertion in model container [2019-01-18 18:07:46,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:46" (2/2) ... [2019-01-18 18:07:46,647 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-01-18 18:07:46,671 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 18:07:46,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-18 18:07:46,720 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-18 18:07:46,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 18:07:46,759 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 18:07:46,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 18:07:46,760 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 18:07:46,760 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 18:07:46,760 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 18:07:46,760 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 18:07:46,760 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 18:07:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-18 18:07:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 18:07:46,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:46,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 18:07:46,789 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-18 18:07:46,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:46,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:46,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:46,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:46,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:46,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:07:46,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:07:46,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:46,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:07:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:07:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:46,987 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-18 18:07:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:47,226 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-18 18:07:47,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:07:47,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 18:07:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:47,245 INFO L225 Difference]: With dead ends: 25 [2019-01-18 18:07:47,245 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 18:07:47,248 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-01-18 18:07:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 18:07:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-18 18:07:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 18:07:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-18 18:07:47,278 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-18 18:07:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:47,279 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-18 18:07:47,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:07:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-18 18:07:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:47,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:47,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:47,281 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-18 18:07:47,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:47,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:47,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:47,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:47,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:47,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:07:47,442 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-18 18:07:47,516 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:47,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:57,822 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:07:57,824 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-01-18 18:07:57,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:57,829 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:07:58,397 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 72.22% of their original sizes. [2019-01-18 18:07:58,398 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:08:00,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_98 Int) (v_idx_99 Int) (v_idx_96 Int) (v_idx_97 Int) (v_idx_94 Int) (v_idx_95 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_100 Int) (v_idx_101 Int) (v_idx_91 Int)) (exists ((v_b_149_1 Int) (v_b_148_1 Int) (v_b_151_1 Int) (v_b_150_1 Int) (v_b_155_1 Int) (v_v_1259_1 Int) (v_b_154_1 Int) (v_v_1257_1 Int) (v_v_1267_1 Int) (v_v_1265_1 Int) (v_v_1264_1 Int) (v_v_1263_1 Int) (v_v_1261_1 Int)) (let ((.cse2 (+ v_b_149_1 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse1 (+ c_ULTIMATE.start_main_p4 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse6 (+ v_b_148_1 1)) (.cse4 (+ v_b_150_1 1)) (.cse3 (+ v_b_148_1 2)) (.cse8 (+ v_b_154_1 1))) (and (<= .cse0 v_b_148_1) (or (<= v_b_154_1 v_idx_99) (< v_idx_99 .cse1) (= (select |c_#memory_int| v_idx_99) v_v_1265_1)) (<= .cse2 v_b_151_1) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_154_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_91) (= (select |c_#memory_int| v_idx_91) v_v_1257_1)) (<= .cse3 v_b_151_1) (or (< v_idx_96 v_b_150_1) (<= v_b_151_1 v_idx_96) (= (select |c_#memory_int| v_idx_96) 0)) (<= (+ v_b_148_1 4) v_b_155_1) (or (= (select |c_#memory_int| v_idx_101) v_v_1267_1) (< v_idx_101 v_b_155_1)) (<= (+ v_b_148_1 3) v_b_154_1) (<= (* 2 v_v_1264_1) 0) (<= .cse4 v_b_151_1) (<= .cse5 v_b_151_1) (<= .cse2 c_ULTIMATE.start_main_p4) (<= (+ v_b_151_1 2) v_b_155_1) (<= .cse1 v_b_154_1) (or (<= v_b_149_1 v_idx_94) (< v_idx_94 v_b_148_1) (= (select |c_#memory_int| v_idx_94) 0)) (<= .cse6 v_b_149_1) (<= (+ v_b_150_1 2) v_b_154_1) (<= .cse7 v_b_150_1) (<= .cse7 v_b_149_1) (<= .cse5 c_ULTIMATE.start_main_p4) (<= v_v_1264_1 0) (<= .cse4 c_ULTIMATE.start_main_p4) (or (< v_idx_93 .cse0) (<= v_b_148_1 v_idx_93) (= (select |c_#memory_int| v_idx_93) v_v_1259_1)) (or (< v_idx_95 v_b_149_1) (<= v_b_150_1 v_idx_95) (= (select |c_#memory_int| v_idx_95) v_v_1261_1)) (<= v_b_155_1 .cse8) (or (= (select |c_#memory_int| v_idx_98) v_v_1264_1) (<= .cse1 v_idx_98) (< v_idx_98 c_ULTIMATE.start_main_p4)) (<= v_b_149_1 v_b_150_1) (<= v_b_149_1 .cse6) (or (< v_idx_92 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_92) (= (select |c_#memory_int| v_idx_92) 0)) (<= .cse6 v_b_150_1) (<= (+ v_b_149_1 2) v_b_154_1) (<= v_b_151_1 .cse4) (or (= (select |c_#memory_int| v_idx_100) 0) (< v_idx_100 v_b_154_1) (<= v_b_155_1 v_idx_100)) (<= .cse3 c_ULTIMATE.start_main_p4) (<= (+ v_b_151_1 1) v_b_154_1) (<= (+ v_b_149_1 3) v_b_155_1) (<= (+ c_ULTIMATE.start_main_p4 2) v_b_155_1) (<= .cse8 v_b_155_1) (<= (+ c_ULTIMATE.start_main_p1 5) v_b_155_1) (<= v_b_151_1 c_ULTIMATE.start_main_p4) (<= (+ v_b_150_1 3) v_b_155_1) (or (= (select |c_#memory_int| v_idx_97) v_v_1263_1) (<= c_ULTIMATE.start_main_p4 v_idx_97) (< v_idx_97 v_b_151_1)))))) is different from false [2019-01-18 18:08:03,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_104 Int) (v_idx_105 Int) (v_idx_102 Int) (v_idx_103 Int) (v_idx_108 Int) (v_idx_109 Int) (v_idx_106 Int) (v_idx_107 Int) (v_idx_111 Int) (v_idx_112 Int) (v_idx_110 Int)) (exists ((v_b_149_1 Int) (v_b_148_1 Int) (v_b_153_1 Int) (v_b_152_1 Int) (v_b_151_1 Int) (v_b_150_1 Int) (v_b_155_1 Int) (v_v_1259_1 Int) (v_b_154_1 Int) (v_v_1257_1 Int) (v_v_1267_1 Int) (v_v_1265_1 Int) (v_v_1264_1 Int) (v_v_1263_1 Int) (v_v_1261_1 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p1 2)) (.cse4 (+ v_b_148_1 1)) (.cse7 (+ v_b_151_1 1)) (.cse9 (+ v_b_149_1 1)) (.cse2 (+ v_b_150_1 1)) (.cse8 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ v_b_148_1 3)) (.cse10 (+ c_ULTIMATE.start_main_p1 3)) (.cse0 (+ c_ULTIMATE.start_main_p1 4)) (.cse1 (+ v_b_148_1 2)) (.cse5 (+ v_b_150_1 2)) (.cse11 (+ v_b_149_1 2)) (.cse13 (+ v_b_154_1 1)) (.cse12 (+ v_b_152_1 1))) (and (or (= (select |c_#memory_int| v_idx_105) 0) (<= v_b_149_1 v_idx_105) (< v_idx_105 v_b_148_1)) (<= .cse0 v_b_154_1) (<= .cse1 v_b_151_1) (<= .cse2 v_b_151_1) (<= .cse3 v_b_153_1) (<= .cse4 v_b_149_1) (<= .cse5 v_b_154_1) (<= .cse6 v_b_150_1) (<= (+ v_b_152_1 2) v_b_155_1) (<= .cse6 v_b_149_1) (or (= (select |c_#memory_int| v_idx_112) v_v_1267_1) (< v_idx_112 v_b_155_1)) (<= .cse7 v_b_153_1) (or (<= v_b_152_1 v_idx_108) (= (select |c_#memory_int| v_idx_108) v_v_1263_1) (< v_idx_108 v_b_151_1)) (or (< v_idx_104 .cse8) (= (select |c_#memory_int| v_idx_104) v_v_1259_1) (<= v_b_148_1 v_idx_104)) (or (< v_idx_106 v_b_149_1) (<= v_b_150_1 v_idx_106) (= (select |c_#memory_int| v_idx_106) v_v_1261_1)) (<= v_b_149_1 v_b_150_1) (<= v_b_149_1 .cse4) (<= .cse9 v_b_152_1) (<= .cse4 v_b_150_1) (<= .cse10 v_b_152_1) (<= v_b_151_1 .cse2) (<= .cse7 v_b_154_1) (<= (+ v_b_149_1 3) v_b_155_1) (<= .cse11 v_b_153_1) (<= (+ c_ULTIMATE.start_main_p1 5) v_b_155_1) (<= (+ v_b_150_1 3) v_b_155_1) (or (= (select |c_#memory_int| v_idx_102) v_v_1257_1) (<= c_ULTIMATE.start_main_p1 v_idx_102)) (<= .cse8 v_b_148_1) (<= .cse9 v_b_151_1) (<= .cse2 v_b_152_1) (<= (+ v_b_148_1 4) v_b_155_1) (or (= (select |c_#memory_int| v_idx_103) 0) (< v_idx_103 c_ULTIMATE.start_main_p1) (<= .cse8 v_idx_103)) (<= .cse3 v_b_154_1) (<= (* 2 v_v_1264_1) 0) (<= .cse12 v_b_153_1) (<= .cse10 v_b_151_1) (or (< v_idx_107 v_b_150_1) (<= v_b_151_1 v_idx_107) (= (select |c_#memory_int| v_idx_107) 0)) (or (= (select |c_#memory_int| v_idx_109) v_v_1264_1) (<= v_b_153_1 v_idx_109) (< v_idx_109 v_b_152_1)) (<= (+ v_b_151_1 2) v_b_155_1) (or (= 0 (select |c_#memory_int| v_idx_111)) (< v_idx_111 v_b_154_1) (<= v_b_155_1 v_idx_111)) (<= v_v_1264_1 0) (<= .cse0 v_b_153_1) (<= v_b_151_1 v_b_152_1) (<= v_b_155_1 .cse13) (<= .cse12 v_b_154_1) (<= .cse1 v_b_152_1) (<= .cse5 v_b_153_1) (<= .cse11 v_b_154_1) (<= .cse13 v_b_155_1) (or (<= v_b_154_1 v_idx_110) (= (select |c_#memory_int| v_idx_110) v_v_1265_1) (< v_idx_110 v_b_153_1)) (<= v_b_153_1 v_b_154_1) (<= v_b_153_1 .cse12) (<= (+ v_b_153_1 1) v_b_155_1))))) is different from false [2019-01-18 18:08:03,252 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:08:03,253 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:08:03,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:08:03,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:08:03,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:03,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:03,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:03,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:08:03,256 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 4 states. [2019-01-18 18:08:05,650 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_98 Int) (v_idx_99 Int) (v_idx_96 Int) (v_idx_97 Int) (v_idx_94 Int) (v_idx_95 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_100 Int) (v_idx_101 Int) (v_idx_91 Int)) (exists ((v_b_149_1 Int) (v_b_148_1 Int) (v_b_151_1 Int) (v_b_150_1 Int) (v_b_155_1 Int) (v_v_1259_1 Int) (v_b_154_1 Int) (v_v_1257_1 Int) (v_v_1267_1 Int) (v_v_1265_1 Int) (v_v_1264_1 Int) (v_v_1263_1 Int) (v_v_1261_1 Int)) (let ((.cse2 (+ v_b_149_1 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse1 (+ c_ULTIMATE.start_main_p4 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse6 (+ v_b_148_1 1)) (.cse4 (+ v_b_150_1 1)) (.cse3 (+ v_b_148_1 2)) (.cse8 (+ v_b_154_1 1))) (and (<= .cse0 v_b_148_1) (or (<= v_b_154_1 v_idx_99) (< v_idx_99 .cse1) (= (select |c_#memory_int| v_idx_99) v_v_1265_1)) (<= .cse2 v_b_151_1) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_154_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_91) (= (select |c_#memory_int| v_idx_91) v_v_1257_1)) (<= .cse3 v_b_151_1) (or (< v_idx_96 v_b_150_1) (<= v_b_151_1 v_idx_96) (= (select |c_#memory_int| v_idx_96) 0)) (<= (+ v_b_148_1 4) v_b_155_1) (or (= (select |c_#memory_int| v_idx_101) v_v_1267_1) (< v_idx_101 v_b_155_1)) (<= (+ v_b_148_1 3) v_b_154_1) (<= (* 2 v_v_1264_1) 0) (<= .cse4 v_b_151_1) (<= .cse5 v_b_151_1) (<= .cse2 c_ULTIMATE.start_main_p4) (<= (+ v_b_151_1 2) v_b_155_1) (<= .cse1 v_b_154_1) (or (<= v_b_149_1 v_idx_94) (< v_idx_94 v_b_148_1) (= (select |c_#memory_int| v_idx_94) 0)) (<= .cse6 v_b_149_1) (<= (+ v_b_150_1 2) v_b_154_1) (<= .cse7 v_b_150_1) (<= .cse7 v_b_149_1) (<= .cse5 c_ULTIMATE.start_main_p4) (<= v_v_1264_1 0) (<= .cse4 c_ULTIMATE.start_main_p4) (or (< v_idx_93 .cse0) (<= v_b_148_1 v_idx_93) (= (select |c_#memory_int| v_idx_93) v_v_1259_1)) (or (< v_idx_95 v_b_149_1) (<= v_b_150_1 v_idx_95) (= (select |c_#memory_int| v_idx_95) v_v_1261_1)) (<= v_b_155_1 .cse8) (or (= (select |c_#memory_int| v_idx_98) v_v_1264_1) (<= .cse1 v_idx_98) (< v_idx_98 c_ULTIMATE.start_main_p4)) (<= v_b_149_1 v_b_150_1) (<= v_b_149_1 .cse6) (or (< v_idx_92 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_92) (= (select |c_#memory_int| v_idx_92) 0)) (<= .cse6 v_b_150_1) (<= (+ v_b_149_1 2) v_b_154_1) (<= v_b_151_1 .cse4) (or (= (select |c_#memory_int| v_idx_100) 0) (< v_idx_100 v_b_154_1) (<= v_b_155_1 v_idx_100)) (<= .cse3 c_ULTIMATE.start_main_p4) (<= (+ v_b_151_1 1) v_b_154_1) (<= (+ v_b_149_1 3) v_b_155_1) (<= (+ c_ULTIMATE.start_main_p4 2) v_b_155_1) (<= .cse8 v_b_155_1) (<= (+ c_ULTIMATE.start_main_p1 5) v_b_155_1) (<= v_b_151_1 c_ULTIMATE.start_main_p4) (<= (+ v_b_150_1 3) v_b_155_1) (or (= (select |c_#memory_int| v_idx_97) v_v_1263_1) (<= c_ULTIMATE.start_main_p4 v_idx_97) (< v_idx_97 v_b_151_1)))))) (forall ((v_idx_104 Int) (v_idx_105 Int) (v_idx_102 Int) (v_idx_103 Int) (v_idx_108 Int) (v_idx_109 Int) (v_idx_106 Int) (v_idx_107 Int) (v_idx_111 Int) (v_idx_112 Int) (v_idx_110 Int)) (exists ((v_b_149_1 Int) (v_b_148_1 Int) (v_b_153_1 Int) (v_b_152_1 Int) (v_b_151_1 Int) (v_b_150_1 Int) (v_b_155_1 Int) (v_v_1259_1 Int) (v_b_154_1 Int) (v_v_1257_1 Int) (v_v_1267_1 Int) (v_v_1265_1 Int) (v_v_1264_1 Int) (v_v_1263_1 Int) (v_v_1261_1 Int)) (let ((.cse15 (+ c_ULTIMATE.start_main_p1 2)) (.cse13 (+ v_b_148_1 1)) (.cse16 (+ v_b_151_1 1)) (.cse18 (+ v_b_149_1 1)) (.cse11 (+ v_b_150_1 1)) (.cse17 (+ c_ULTIMATE.start_main_p1 1)) (.cse12 (+ v_b_148_1 3)) (.cse19 (+ c_ULTIMATE.start_main_p1 3)) (.cse9 (+ c_ULTIMATE.start_main_p1 4)) (.cse10 (+ v_b_148_1 2)) (.cse14 (+ v_b_150_1 2)) (.cse20 (+ v_b_149_1 2)) (.cse22 (+ v_b_154_1 1)) (.cse21 (+ v_b_152_1 1))) (and (or (= (select |c_#memory_int| v_idx_105) 0) (<= v_b_149_1 v_idx_105) (< v_idx_105 v_b_148_1)) (<= .cse9 v_b_154_1) (<= .cse10 v_b_151_1) (<= .cse11 v_b_151_1) (<= .cse12 v_b_153_1) (<= .cse13 v_b_149_1) (<= .cse14 v_b_154_1) (<= .cse15 v_b_150_1) (<= (+ v_b_152_1 2) v_b_155_1) (<= .cse15 v_b_149_1) (or (= (select |c_#memory_int| v_idx_112) v_v_1267_1) (< v_idx_112 v_b_155_1)) (<= .cse16 v_b_153_1) (or (<= v_b_152_1 v_idx_108) (= (select |c_#memory_int| v_idx_108) v_v_1263_1) (< v_idx_108 v_b_151_1)) (or (< v_idx_104 .cse17) (= (select |c_#memory_int| v_idx_104) v_v_1259_1) (<= v_b_148_1 v_idx_104)) (or (< v_idx_106 v_b_149_1) (<= v_b_150_1 v_idx_106) (= (select |c_#memory_int| v_idx_106) v_v_1261_1)) (<= v_b_149_1 v_b_150_1) (<= v_b_149_1 .cse13) (<= .cse18 v_b_152_1) (<= .cse13 v_b_150_1) (<= .cse19 v_b_152_1) (<= v_b_151_1 .cse11) (<= .cse16 v_b_154_1) (<= (+ v_b_149_1 3) v_b_155_1) (<= .cse20 v_b_153_1) (<= (+ c_ULTIMATE.start_main_p1 5) v_b_155_1) (<= (+ v_b_150_1 3) v_b_155_1) (or (= (select |c_#memory_int| v_idx_102) v_v_1257_1) (<= c_ULTIMATE.start_main_p1 v_idx_102)) (<= .cse17 v_b_148_1) (<= .cse18 v_b_151_1) (<= .cse11 v_b_152_1) (<= (+ v_b_148_1 4) v_b_155_1) (or (= (select |c_#memory_int| v_idx_103) 0) (< v_idx_103 c_ULTIMATE.start_main_p1) (<= .cse17 v_idx_103)) (<= .cse12 v_b_154_1) (<= (* 2 v_v_1264_1) 0) (<= .cse21 v_b_153_1) (<= .cse19 v_b_151_1) (or (< v_idx_107 v_b_150_1) (<= v_b_151_1 v_idx_107) (= (select |c_#memory_int| v_idx_107) 0)) (or (= (select |c_#memory_int| v_idx_109) v_v_1264_1) (<= v_b_153_1 v_idx_109) (< v_idx_109 v_b_152_1)) (<= (+ v_b_151_1 2) v_b_155_1) (or (= 0 (select |c_#memory_int| v_idx_111)) (< v_idx_111 v_b_154_1) (<= v_b_155_1 v_idx_111)) (<= v_v_1264_1 0) (<= .cse9 v_b_153_1) (<= v_b_151_1 v_b_152_1) (<= v_b_155_1 .cse22) (<= .cse21 v_b_154_1) (<= .cse10 v_b_152_1) (<= .cse14 v_b_153_1) (<= .cse20 v_b_154_1) (<= .cse22 v_b_155_1) (or (<= v_b_154_1 v_idx_110) (= (select |c_#memory_int| v_idx_110) v_v_1265_1) (< v_idx_110 v_b_153_1)) (<= v_b_153_1 v_b_154_1) (<= v_b_153_1 .cse21) (<= (+ v_b_153_1 1) v_b_155_1)))))) is different from false [2019-01-18 18:08:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:40,700 INFO L93 Difference]: Finished difference Result 14 states and 28 transitions. [2019-01-18 18:08:40,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:08:40,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:08:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:40,702 INFO L225 Difference]: With dead ends: 14 [2019-01-18 18:08:40,702 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 18:08:40,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:08:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 18:08:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-18 18:08:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 18:08:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2019-01-18 18:08:40,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 27 transitions. Word has length 3 [2019-01-18 18:08:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:40,709 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 27 transitions. [2019-01-18 18:08:40,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 27 transitions. [2019-01-18 18:08:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:40,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:40,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:40,710 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-18 18:08:40,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:40,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:40,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:40,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:40,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:40,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:40,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:40,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:08:40,834 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-18 18:08:40,838 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:40,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:48,469 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:08:48,469 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-01-18 18:08:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:48,470 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:08:48,839 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 72.22% of their original sizes. [2019-01-18 18:08:48,839 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:08:51,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_203 Int) (v_idx_204 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_207 Int) (v_idx_208 Int) (v_idx_205 Int) (v_idx_206 Int) (v_idx_209 Int) (v_idx_210 Int) (v_idx_211 Int)) (exists ((v_v_1453_2 Int) (v_v_1451_2 Int) (v_b_148_2 Int) (v_b_149_2 Int) (v_v_1447_2 Int) (v_v_1457_2 Int) (v_v_1456_2 Int) (v_v_1455_2 Int) (v_v_1449_2 Int) (v_b_152_2 Int) (v_b_151_2 Int) (v_b_150_2 Int) (v_b_153_2 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p1 2)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse8 (+ c_ULTIMATE.start_main_p1 3)) (.cse5 (+ v_b_150_2 1)) (.cse11 (+ v_b_150_2 2)) (.cse9 (+ c_ULTIMATE.start_main_p5 1)) (.cse3 (+ v_b_149_2 2)) (.cse12 (+ c_ULTIMATE.start_main_p1 4)) (.cse7 (+ v_b_148_2 2)) (.cse4 (+ v_b_148_2 3)) (.cse10 (+ v_b_149_2 1)) (.cse0 (+ v_b_148_2 1)) (.cse2 (+ v_b_152_2 1)) (.cse13 (+ v_b_151_2 1))) (and (<= v_b_149_2 .cse0) (<= v_b_153_2 c_ULTIMATE.start_main_p5) (<= .cse1 v_b_148_2) (<= .cse2 v_b_153_2) (or (< v_idx_206 v_b_148_2) (<= v_b_149_2 v_idx_206) (= 0 (select |c_#memory_int| v_idx_206))) (<= .cse0 v_b_150_2) (<= .cse3 v_b_153_2) (<= .cse4 v_b_153_2) (<= .cse5 v_b_151_2) (<= .cse6 v_b_150_2) (<= .cse7 v_b_152_2) (<= .cse6 v_b_149_2) (<= .cse8 v_b_151_2) (or (= (select |c_#memory_int| v_idx_205) v_v_1449_2) (< v_idx_205 .cse1) (<= v_b_148_2 v_idx_205)) (or (< v_idx_211 v_b_153_2) (<= c_ULTIMATE.start_main_p5 v_idx_211) (= (select |c_#memory_int| v_idx_211) v_v_1455_2)) (or (= 0 (select |c_#memory_int| v_idx_208)) (<= v_b_151_2 v_idx_208) (< v_idx_208 v_b_150_2)) (or (<= v_b_152_2 v_idx_209) (= (select |c_#memory_int| v_idx_209) v_v_1453_2) (< v_idx_209 v_b_151_2)) (or (< v_idx_212 c_ULTIMATE.start_main_p5) (= (select |c_#memory_int| v_idx_212) v_v_1456_2) (<= .cse9 v_idx_212)) (<= .cse5 v_b_152_2) (or (<= .cse1 v_idx_204) (= (select |c_#memory_int| v_idx_204) 0) (< v_idx_204 c_ULTIMATE.start_main_p1)) (<= .cse10 v_b_152_2) (<= .cse8 v_b_152_2) (or (<= c_ULTIMATE.start_main_p1 v_idx_203) (= (select |c_#memory_int| v_idx_203) v_v_1447_2)) (<= v_b_151_2 .cse5) (<= .cse11 c_ULTIMATE.start_main_p5) (<= 0 v_v_1456_2) (<= .cse11 v_b_153_2) (or (< v_idx_210 v_b_152_2) (<= v_b_153_2 v_idx_210) (= 0 (select |c_#memory_int| v_idx_210))) (or (< v_idx_213 .cse9) (= (select |c_#memory_int| v_idx_213) v_v_1457_2)) (or (= (select |c_#memory_int| v_idx_207) v_v_1451_2) (< v_idx_207 v_b_149_2) (<= v_b_150_2 v_idx_207)) (<= .cse3 c_ULTIMATE.start_main_p5) (<= .cse12 c_ULTIMATE.start_main_p5) (<= .cse12 v_b_153_2) (<= .cse7 v_b_151_2) (<= .cse13 v_b_153_2) (<= v_b_149_2 v_b_150_2) (<= .cse4 c_ULTIMATE.start_main_p5) (<= .cse2 c_ULTIMATE.start_main_p5) (<= v_b_151_2 v_b_152_2) (<= .cse10 v_b_151_2) (<= .cse0 v_b_149_2) (<= 0 (* 2 v_v_1456_2)) (<= v_b_153_2 .cse2) (<= .cse13 c_ULTIMATE.start_main_p5))))) is different from false [2019-01-18 18:08:53,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_214 Int) (v_idx_215 Int) (v_idx_223 Int) (v_idx_224 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int) (v_idx_221 Int) (v_idx_222 Int) (v_idx_220 Int)) (exists ((v_v_1453_2 Int) (v_v_1451_2 Int) (v_b_148_2 Int) (v_b_149_2 Int) (v_v_1457_2 Int) (v_v_1447_2 Int) (v_v_1456_2 Int) (v_v_1455_2 Int) (v_v_1449_2 Int) (v_b_152_2 Int) (v_b_151_2 Int) (v_b_150_2 Int) (v_b_155_2 Int) (v_b_154_2 Int) (v_b_153_2 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p1 2)) (.cse1 (+ v_b_148_2 1)) (.cse8 (+ v_b_148_2 3)) (.cse11 (+ v_b_149_2 2)) (.cse6 (+ v_b_148_2 2)) (.cse0 (+ v_b_152_2 1)) (.cse2 (+ v_b_150_2 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 3)) (.cse9 (+ c_ULTIMATE.start_main_p1 1)) (.cse12 (+ c_ULTIMATE.start_main_p1 4)) (.cse10 (+ v_b_154_2 1)) (.cse13 (+ v_b_150_2 2)) (.cse5 (+ v_b_149_2 1)) (.cse7 (+ v_b_151_2 1))) (and (<= .cse0 v_b_153_2) (<= .cse1 v_b_150_2) (or (< v_idx_221 v_b_152_2) (<= v_b_153_2 v_idx_221) (= 0 (select |c_#memory_int| v_idx_221))) (<= .cse2 v_b_151_2) (or (= (select |c_#memory_int| v_idx_223) v_v_1456_2) (<= v_b_155_2 v_idx_223) (< v_idx_223 v_b_154_2)) (or (= (select |c_#memory_int| v_idx_220) v_v_1453_2) (<= v_b_152_2 v_idx_220) (< v_idx_220 v_b_151_2)) (<= .cse3 v_b_150_2) (<= (+ v_b_149_2 3) v_b_155_2) (<= .cse3 v_b_149_2) (<= .cse4 v_b_151_2) (or (= (select |c_#memory_int| v_idx_224) v_v_1457_2) (< v_idx_224 v_b_155_2)) (<= v_b_153_2 v_b_154_2) (<= .cse5 v_b_152_2) (<= v_b_151_2 .cse2) (<= (+ v_b_148_2 4) v_b_155_2) (<= (+ c_ULTIMATE.start_main_p1 5) v_b_155_2) (or (< v_idx_219 v_b_150_2) (= 0 (select |c_#memory_int| v_idx_219)) (<= v_b_151_2 v_idx_219)) (<= .cse6 v_b_151_2) (<= .cse7 v_b_153_2) (<= .cse8 v_b_154_2) (<= .cse1 v_b_149_2) (<= v_b_153_2 .cse0) (<= v_b_149_2 .cse1) (or (<= c_ULTIMATE.start_main_p1 v_idx_214) (= (select |c_#memory_int| v_idx_214) v_v_1447_2)) (or (< v_idx_216 .cse9) (= (select |c_#memory_int| v_idx_216) v_v_1449_2) (<= v_b_148_2 v_idx_216)) (<= .cse9 v_b_148_2) (<= .cse10 v_b_155_2) (<= (+ v_b_153_2 1) v_b_155_2) (<= .cse11 v_b_153_2) (or (= 0 (select |c_#memory_int| v_idx_217)) (<= v_b_149_2 v_idx_217) (< v_idx_217 v_b_148_2)) (<= .cse8 v_b_153_2) (<= (+ v_b_150_2 3) v_b_155_2) (<= .cse11 v_b_154_2) (<= .cse6 v_b_152_2) (or (< v_idx_222 v_b_153_2) (= (select |c_#memory_int| v_idx_222) v_v_1455_2) (<= v_b_154_2 v_idx_222)) (<= (+ v_b_151_2 2) v_b_155_2) (<= .cse0 v_b_154_2) (<= .cse2 v_b_152_2) (<= .cse12 v_b_154_2) (<= .cse4 v_b_152_2) (or (<= .cse9 v_idx_215) (= 0 (select |c_#memory_int| v_idx_215)) (< v_idx_215 c_ULTIMATE.start_main_p1)) (<= 0 v_v_1456_2) (<= (+ v_b_152_2 2) v_b_155_2) (<= .cse13 v_b_153_2) (<= .cse12 v_b_153_2) (<= v_b_155_2 .cse10) (or (< v_idx_218 v_b_149_2) (= (select |c_#memory_int| v_idx_218) v_v_1451_2) (<= v_b_150_2 v_idx_218)) (<= v_b_149_2 v_b_150_2) (<= .cse13 v_b_154_2) (<= v_b_151_2 v_b_152_2) (<= .cse5 v_b_151_2) (<= .cse7 v_b_154_2) (<= 0 (* 2 v_v_1456_2)))))) is different from false [2019-01-18 18:08:54,001 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:08:54,002 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:08:54,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:08:54,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:08:54,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:54,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:08:54,004 INFO L87 Difference]: Start difference. First operand 13 states and 27 transitions. Second operand 4 states. [2019-01-18 18:08:55,767 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-18 18:08:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-18 18:08:55,769 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.getOrConstructPredicateForConjunction(CegarAbsIntRunner.java:698) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) 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) ... 44 more [2019-01-18 18:08:55,772 INFO L168 Benchmark]: Toolchain (without parser) took 69586.06 ms. Allocated memory was 134.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 108.1 MB in the beginning and 300.7 MB in the end (delta: -192.6 MB). Peak memory consumption was 964.0 MB. Max. memory is 7.1 GB. [2019-01-18 18:08:55,774 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 134.2 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 18:08:55,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.28 ms. Allocated memory is still 134.2 MB. Free memory was 108.1 MB in the beginning and 105.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-18 18:08:55,776 INFO L168 Benchmark]: Boogie Preprocessor took 27.81 ms. Allocated memory is still 134.2 MB. Free memory was 105.7 MB in the beginning and 104.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-18 18:08:55,777 INFO L168 Benchmark]: RCFGBuilder took 349.20 ms. Allocated memory is still 134.2 MB. Free memory was 104.6 MB in the beginning and 93.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-01-18 18:08:55,778 INFO L168 Benchmark]: TraceAbstraction took 69146.87 ms. Allocated memory was 134.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 93.7 MB in the beginning and 300.7 MB in the end (delta: -207.0 MB). Peak memory consumption was 949.6 MB. Max. memory is 7.1 GB. [2019-01-18 18:08:55,784 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.18 ms. Allocated memory is still 134.2 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.28 ms. Allocated memory is still 134.2 MB. Free memory was 108.1 MB in the beginning and 105.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.81 ms. Allocated memory is still 134.2 MB. Free memory was 105.7 MB in the beginning and 104.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 349.20 ms. Allocated memory is still 134.2 MB. Free memory was 104.6 MB in the beginning and 93.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69146.87 ms. Allocated memory was 134.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 93.7 MB in the beginning and 300.7 MB in the end (delta: -207.0 MB). Peak memory consumption was 949.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...