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-2-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 18:07:31,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 18:07:31,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 18:07:32,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 18:07:32,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 18:07:32,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 18:07:32,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 18:07:32,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 18:07:32,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 18:07:32,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 18:07:32,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 18:07:32,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 18:07:32,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 18:07:32,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 18:07:32,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 18:07:32,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 18:07:32,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 18:07:32,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 18:07:32,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 18:07:32,025 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 18:07:32,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 18:07:32,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 18:07:32,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 18:07:32,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 18:07:32,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 18:07:32,032 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 18:07:32,033 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 18:07:32,034 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 18:07:32,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 18:07:32,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 18:07:32,036 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 18:07:32,036 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 18:07:32,037 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 18:07:32,037 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 18:07:32,038 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 18:07:32,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 18:07:32,039 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:32,052 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 18:07:32,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 18:07:32,053 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 18:07:32,054 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 18:07:32,054 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 18:07:32,054 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 18:07:32,054 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 18:07:32,054 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 18:07:32,055 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 18:07:32,055 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 18:07:32,055 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 18:07:32,055 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 18:07:32,055 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 18:07:32,056 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 18:07:32,056 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 18:07:32,057 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 18:07:32,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 18:07:32,057 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 18:07:32,057 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 18:07:32,057 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 18:07:32,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 18:07:32,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 18:07:32,058 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 18:07:32,058 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 18:07:32,058 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 18:07:32,059 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 18:07:32,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 18:07:32,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 18:07:32,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 18:07:32,059 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 18:07:32,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 18:07:32,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 18:07:32,060 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 18:07:32,060 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 18:07:32,060 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 18:07:32,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 18:07:32,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 18:07:32,061 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 18:07:32,061 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 18:07:32,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 18:07:32,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 18:07:32,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 18:07:32,118 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 18:07:32,119 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 18:07:32,120 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl [2019-01-18 18:07:32,121 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2019-01-18 18:07:32,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 18:07:32,166 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 18:07:32,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:32,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 18:07:32,167 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 18:07:32,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:32,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 18:07:32,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 18:07:32,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 18:07:32,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/1) ... [2019-01-18 18:07:32,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 18:07:32,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 18:07:32,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 18:07:32,250 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 18:07:32,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (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:32,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 18:07:32,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 18:07:32,557 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 18:07:32,558 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-18 18:07:32,559 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:32 BoogieIcfgContainer [2019-01-18 18:07:32,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 18:07:32,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 18:07:32,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 18:07:32,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 18:07:32,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:32" (1/2) ... [2019-01-18 18:07:32,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182a21a7 and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 06:07:32, skipping insertion in model container [2019-01-18 18:07:32,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:32" (2/2) ... [2019-01-18 18:07:32,568 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2019-01-18 18:07:32,578 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 18:07:32,587 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-18 18:07:32,606 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-18 18:07:32,641 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 18:07:32,642 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 18:07:32,642 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 18:07:32,642 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 18:07:32,642 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 18:07:32,643 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 18:07:32,643 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 18:07:32,643 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 18:07:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-18 18:07:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 18:07:32,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:32,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 18:07:32,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-01-18 18:07:32,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:32,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:32,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:32,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:32,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:32,863 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:32,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:07:32,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:07:32,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:32,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:07:32,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:07:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:32,884 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-18 18:07:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:33,053 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-18 18:07:33,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:07:33,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 18:07:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:33,074 INFO L225 Difference]: With dead ends: 13 [2019-01-18 18:07:33,074 INFO L226 Difference]: Without dead ends: 8 [2019-01-18 18:07:33,080 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:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-18 18:07:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-01-18 18:07:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 18:07:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-18 18:07:33,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-01-18 18:07:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:33,147 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-18 18:07:33,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:07:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-01-18 18:07:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:33,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:33,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:33,149 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:33,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:33,150 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-01-18 18:07:33,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:33,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:33,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:33,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:33,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:33,236 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:33,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:33,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:33,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:07:33,240 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-01-18 18:07:33,302 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:33,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:39,335 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:07:39,337 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:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:39,343 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:07:39,586 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 66.67% of their original sizes. [2019-01-18 18:07:39,586 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:07:41,643 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_58 Int) (v_idx_59 Int) (v_idx_56 Int) (v_idx_57 Int) (v_idx_55 Int)) (exists ((v_b_95_1 Int) (v_v_1028_1 Int) (v_v_1027_1 Int) (v_b_94_1 Int) (v_v_1026_1 Int) (v_v_1030_1 Int)) (let ((.cse0 (+ v_b_94_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (<= v_b_95_1 .cse0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_1) (<= 0 v_v_1027_1) (<= .cse1 v_b_94_1) (or (= 0 (select |c_#memory_int| v_idx_58)) (< v_idx_58 v_b_94_1) (<= v_b_95_1 v_idx_58)) (<= .cse0 v_b_95_1) (<= 0 (* 2 v_v_1027_1)) (or (<= c_ULTIMATE.start_main_p1 v_idx_55) (= (select |c_#memory_int| v_idx_55) v_v_1026_1)) (or (<= v_b_94_1 v_idx_57) (= (select |c_#memory_int| v_idx_57) v_v_1028_1) (< v_idx_57 .cse1)) (or (< v_idx_56 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_56) (= (select |c_#memory_int| v_idx_56) v_v_1027_1)) (or (< v_idx_59 v_b_95_1) (= (select |c_#memory_int| v_idx_59) v_v_1030_1)))))) is different from false [2019-01-18 18:07:43,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int)) (exists ((v_b_95_1 Int) (v_v_1028_1 Int) (v_v_1027_1 Int) (v_b_94_1 Int) (v_v_1026_1 Int) (v_v_1030_1 Int)) (let ((.cse0 (+ v_b_94_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (or (= (select |c_#memory_int| v_idx_64) v_v_1030_1) (< v_idx_64 v_b_95_1)) (or (< v_idx_63 v_b_94_1) (<= v_b_95_1 v_idx_63) (= (select |c_#memory_int| v_idx_63) 0)) (<= v_b_95_1 .cse0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_1) (<= 0 v_v_1027_1) (<= .cse1 v_b_94_1) (<= .cse0 v_b_95_1) (<= 0 (* 2 v_v_1027_1)) (or (<= c_ULTIMATE.start_main_p1 v_idx_60) (= (select |c_#memory_int| v_idx_60) v_v_1026_1)) (or (<= v_b_94_1 v_idx_62) (= (select |c_#memory_int| v_idx_62) v_v_1028_1) (< v_idx_62 .cse1)) (or (= (select |c_#memory_int| v_idx_61) v_v_1027_1) (< v_idx_61 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_61)))))) is different from false [2019-01-18 18:07:43,984 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:07:43,984 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:07:43,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:07:43,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:07:43,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:43,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:07:43,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:07:43,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:07:43,988 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-01-18 18:07:46,199 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_58 Int) (v_idx_59 Int) (v_idx_56 Int) (v_idx_57 Int) (v_idx_55 Int)) (exists ((v_b_95_1 Int) (v_v_1028_1 Int) (v_v_1027_1 Int) (v_b_94_1 Int) (v_v_1026_1 Int) (v_v_1030_1 Int)) (let ((.cse0 (+ v_b_94_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (<= v_b_95_1 .cse0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_1) (<= 0 v_v_1027_1) (<= .cse1 v_b_94_1) (or (= 0 (select |c_#memory_int| v_idx_58)) (< v_idx_58 v_b_94_1) (<= v_b_95_1 v_idx_58)) (<= .cse0 v_b_95_1) (<= 0 (* 2 v_v_1027_1)) (or (<= c_ULTIMATE.start_main_p1 v_idx_55) (= (select |c_#memory_int| v_idx_55) v_v_1026_1)) (or (<= v_b_94_1 v_idx_57) (= (select |c_#memory_int| v_idx_57) v_v_1028_1) (< v_idx_57 .cse1)) (or (< v_idx_56 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_56) (= (select |c_#memory_int| v_idx_56) v_v_1027_1)) (or (< v_idx_59 v_b_95_1) (= (select |c_#memory_int| v_idx_59) v_v_1030_1)))))) (forall ((v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int)) (exists ((v_b_95_1 Int) (v_v_1028_1 Int) (v_v_1027_1 Int) (v_b_94_1 Int) (v_v_1026_1 Int) (v_v_1030_1 Int)) (let ((.cse2 (+ v_b_94_1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 1))) (and (or (= (select |c_#memory_int| v_idx_64) v_v_1030_1) (< v_idx_64 v_b_95_1)) (or (< v_idx_63 v_b_94_1) (<= v_b_95_1 v_idx_63) (= (select |c_#memory_int| v_idx_63) 0)) (<= v_b_95_1 .cse2) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_1) (<= 0 v_v_1027_1) (<= .cse3 v_b_94_1) (<= .cse2 v_b_95_1) (<= 0 (* 2 v_v_1027_1)) (or (<= c_ULTIMATE.start_main_p1 v_idx_60) (= (select |c_#memory_int| v_idx_60) v_v_1026_1)) (or (<= v_b_94_1 v_idx_62) (= (select |c_#memory_int| v_idx_62) v_v_1028_1) (< v_idx_62 .cse3)) (or (= (select |c_#memory_int| v_idx_61) v_v_1027_1) (< v_idx_61 c_ULTIMATE.start_main_p1) (<= .cse3 v_idx_61))))))) is different from false [2019-01-18 18:07:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:59,378 INFO L93 Difference]: Finished difference Result 8 states and 13 transitions. [2019-01-18 18:07:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:07:59,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:07:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:59,379 INFO L225 Difference]: With dead ends: 8 [2019-01-18 18:07:59,379 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 18:07:59,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:07:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 18:07:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-18 18:07:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 18:07:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-01-18 18:07:59,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 12 transitions. Word has length 3 [2019-01-18 18:07:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:59,386 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 12 transitions. [2019-01-18 18:07:59,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:07:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 12 transitions. [2019-01-18 18:07:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:59,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:59,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:59,390 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-01-18 18:07:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:59,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:59,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:59,545 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:59,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:59,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:59,546 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:07:59,546 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-01-18 18:07:59,548 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:59,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:02,423 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:08:02,424 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:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:02,424 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:08:02,569 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 58.33% of their original sizes. [2019-01-18 18:08:02,570 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:08:04,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_119 Int) (v_idx_122 Int) (v_idx_123 Int) (v_idx_120 Int) (v_idx_121 Int)) (exists ((v_v_870_2 Int) (v_v_874_2 Int) (v_v_873_2 Int) (v_v_872_2 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ c_ULTIMATE.start_main_p2 1))) (and (<= v_v_873_2 0) (or (= (select |c_#memory_int| v_idx_123) v_v_874_2) (< v_idx_123 .cse0)) (or (= (select |c_#memory_int| v_idx_120) 0) (< v_idx_120 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_120)) (or (< v_idx_121 .cse1) (<= c_ULTIMATE.start_main_p2 v_idx_121) (= v_v_872_2 (select |c_#memory_int| v_idx_121))) (or (= (select |c_#memory_int| v_idx_119) v_v_870_2) (<= c_ULTIMATE.start_main_p1 v_idx_119)) (<= .cse1 c_ULTIMATE.start_main_p2) (or (<= .cse0 v_idx_122) (= (select |c_#memory_int| v_idx_122) v_v_873_2) (< v_idx_122 c_ULTIMATE.start_main_p2)) (<= (* 2 v_v_873_2) 0))))) is different from false [2019-01-18 18:08:06,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_126 Int) (v_idx_127 Int) (v_idx_124 Int) (v_idx_125 Int) (v_idx_128 Int)) (exists ((v_b_95_2 Int) (v_b_94_2 Int) (v_v_870_2 Int) (v_v_874_2 Int) (v_v_873_2 Int) (v_v_872_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ v_b_94_2 1))) (and (<= v_v_873_2 0) (or (= (select |c_#memory_int| v_idx_128) v_v_874_2) (< v_idx_128 v_b_95_2)) (<= .cse0 v_b_94_2) (or (<= c_ULTIMATE.start_main_p1 v_idx_124) (= (select |c_#memory_int| v_idx_124) v_v_870_2)) (or (<= .cse0 v_idx_125) (< v_idx_125 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_125))) (<= .cse1 v_b_95_2) (or (= v_v_872_2 (select |c_#memory_int| v_idx_126)) (< v_idx_126 .cse0) (<= v_b_94_2 v_idx_126)) (or (= (select |c_#memory_int| v_idx_127) v_v_873_2) (< v_idx_127 v_b_94_2) (<= v_b_95_2 v_idx_127)) (<= v_b_95_2 .cse1) (<= (* 2 v_v_873_2) 0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_2))))) is different from false [2019-01-18 18:08:06,889 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:08:06,890 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:08:06,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:08:06,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:08:06,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:06,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:06,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:06,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:08:06,891 INFO L87 Difference]: Start difference. First operand 7 states and 12 transitions. Second operand 4 states. [2019-01-18 18:08:09,218 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_126 Int) (v_idx_127 Int) (v_idx_124 Int) (v_idx_125 Int) (v_idx_128 Int)) (exists ((v_b_95_2 Int) (v_b_94_2 Int) (v_v_870_2 Int) (v_v_874_2 Int) (v_v_873_2 Int) (v_v_872_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ v_b_94_2 1))) (and (<= v_v_873_2 0) (or (= (select |c_#memory_int| v_idx_128) v_v_874_2) (< v_idx_128 v_b_95_2)) (<= .cse0 v_b_94_2) (or (<= c_ULTIMATE.start_main_p1 v_idx_124) (= (select |c_#memory_int| v_idx_124) v_v_870_2)) (or (<= .cse0 v_idx_125) (< v_idx_125 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_125))) (<= .cse1 v_b_95_2) (or (= v_v_872_2 (select |c_#memory_int| v_idx_126)) (< v_idx_126 .cse0) (<= v_b_94_2 v_idx_126)) (or (= (select |c_#memory_int| v_idx_127) v_v_873_2) (< v_idx_127 v_b_94_2) (<= v_b_95_2 v_idx_127)) (<= v_b_95_2 .cse1) (<= (* 2 v_v_873_2) 0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_2))))) (forall ((v_idx_119 Int) (v_idx_122 Int) (v_idx_123 Int) (v_idx_120 Int) (v_idx_121 Int)) (exists ((v_v_870_2 Int) (v_v_874_2 Int) (v_v_873_2 Int) (v_v_872_2 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1))) (and (<= v_v_873_2 0) (or (= (select |c_#memory_int| v_idx_123) v_v_874_2) (< v_idx_123 .cse2)) (or (= (select |c_#memory_int| v_idx_120) 0) (< v_idx_120 c_ULTIMATE.start_main_p1) (<= .cse3 v_idx_120)) (or (< v_idx_121 .cse3) (<= c_ULTIMATE.start_main_p2 v_idx_121) (= v_v_872_2 (select |c_#memory_int| v_idx_121))) (or (= (select |c_#memory_int| v_idx_119) v_v_870_2) (<= c_ULTIMATE.start_main_p1 v_idx_119)) (<= .cse3 c_ULTIMATE.start_main_p2) (or (<= .cse2 v_idx_122) (= (select |c_#memory_int| v_idx_122) v_v_873_2) (< v_idx_122 c_ULTIMATE.start_main_p2)) (<= (* 2 v_v_873_2) 0)))))) is different from false [2019-01-18 18:08:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:16,434 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-01-18 18:08:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:08:16,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:08:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:16,434 INFO L225 Difference]: With dead ends: 9 [2019-01-18 18:08:16,435 INFO L226 Difference]: Without dead ends: 8 [2019-01-18 18:08:16,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:08:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-18 18:08:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-18 18:08:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 18:08:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-01-18 18:08:16,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 12 transitions. Word has length 3 [2019-01-18 18:08:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:16,440 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 12 transitions. [2019-01-18 18:08:16,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 12 transitions. [2019-01-18 18:08:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:16,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:16,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:16,442 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-01-18 18:08:16,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:16,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:16,503 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:08:16,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:08:16,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:08:16,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:16,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:08:16,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:08:16,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:08:16,505 INFO L87 Difference]: Start difference. First operand 7 states and 12 transitions. Second operand 3 states. [2019-01-18 18:08:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:16,586 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2019-01-18 18:08:16,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:16,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 18:08:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:16,587 INFO L225 Difference]: With dead ends: 9 [2019-01-18 18:08:16,588 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 18:08:16,588 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:08:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 18:08:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-18 18:08:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 18:08:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-01-18 18:08:16,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 3 [2019-01-18 18:08:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:16,595 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2019-01-18 18:08:16,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:08:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2019-01-18 18:08:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:16,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:16,596 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-18 18:08:16,596 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 929484, now seen corresponding path program 2 times [2019-01-18 18:08:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:16,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:16,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:16,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:16,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:16,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:16,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:16,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:16,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:16,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:16,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:16,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:16,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 18:08:16,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:16,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:16,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 18:08:16,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 18:08:16,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:16,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-01-18 18:08:17,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-18 18:08:17,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:17,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 18:08:17,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:17,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:17,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 18:08:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:17,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:17,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:08:17,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2019-01-18 18:08:17,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:17,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:08:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:08:17,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:08:17,151 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2019-01-18 18:08:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:17,304 INFO L93 Difference]: Finished difference Result 14 states and 26 transitions. [2019-01-18 18:08:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:17,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-18 18:08:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:17,305 INFO L225 Difference]: With dead ends: 14 [2019-01-18 18:08:17,305 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 18:08:17,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:08:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 18:08:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2019-01-18 18:08:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 18:08:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2019-01-18 18:08:17,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 22 transitions. Word has length 4 [2019-01-18 18:08:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:17,312 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 22 transitions. [2019-01-18 18:08:17,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:08:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 22 transitions. [2019-01-18 18:08:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:17,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:17,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:17,314 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-01-18 18:08:17,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:17,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:17,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:17,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:17,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:17,445 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:17,445 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-01-18 18:08:17,446 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:17,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:25,933 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:08:25,933 INFO L272 AbstractInterpreter]: Visited 4 different actions 34 times. Merged at 2 different actions 10 times. Widened at 2 different actions 6 times. Found 12 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:25,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:25,934 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:08:26,182 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 55.56% of their original sizes. [2019-01-18 18:08:26,182 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:08:28,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_214 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_210 Int) (v_idx_211 Int)) (exists ((v_v_3377_1 Int) (v_v_3376_1 Int) (v_v_3375_1 Int) (v_v_3374_1 Int) (v_v_3373_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (<= 0 (* 2 v_v_3374_1)) (<= v_v_3376_1 v_v_3374_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_210) (= (select |c_#memory_int| v_idx_210) v_v_3373_1)) (or (<= .cse0 v_idx_211) (< v_idx_211 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_211) v_v_3374_1)) (or (< v_idx_212 .cse0) (= (select |c_#memory_int| v_idx_212) v_v_3375_1) (<= c_ULTIMATE.start_main_p2 v_idx_212)) (or (< v_idx_214 .cse1) (= (select |c_#memory_int| v_idx_214) v_v_3377_1)) (<= .cse0 c_ULTIMATE.start_main_p2) (<= (* 2 v_v_3376_1) 0) (or (= (select |c_#memory_int| v_idx_213) v_v_3376_1) (<= .cse1 v_idx_213) (< v_idx_213 c_ULTIMATE.start_main_p2)))))) is different from false [2019-01-18 18:08:30,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_215 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int)) (exists ((v_v_3377_1 Int) (v_v_3376_1 Int) (v_v_3375_1 Int) (v_v_3374_1 Int) (v_v_3373_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (<= 0 (* 2 v_v_3374_1)) (<= v_v_3376_1 v_v_3374_1) (or (= (select |c_#memory_int| v_idx_217) v_v_3375_1) (< v_idx_217 .cse0) (<= c_ULTIMATE.start_main_p2 v_idx_217)) (or (= (select |c_#memory_int| v_idx_215) v_v_3373_1) (<= c_ULTIMATE.start_main_p1 v_idx_215)) (or (= (select |c_#memory_int| v_idx_219) v_v_3377_1) (< v_idx_219 .cse1)) (or (= (select |c_#memory_int| v_idx_216) v_v_3374_1) (< v_idx_216 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_216)) (<= .cse0 c_ULTIMATE.start_main_p2) (<= (* 2 v_v_3376_1) 0) (or (< v_idx_218 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_218) v_v_3376_1) (<= .cse1 v_idx_218)))))) is different from false [2019-01-18 18:08:32,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_223 Int) (v_idx_224 Int) (v_idx_221 Int) (v_idx_222 Int) (v_idx_220 Int)) (exists ((v_v_3377_1 Int) (v_v_3376_1 Int) (v_b_261_1 Int) (v_b_260_1 Int) (v_v_3375_1 Int) (v_v_3374_1 Int) (v_v_3373_1 Int)) (let ((.cse1 (+ v_b_260_1 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) v_b_261_1) (<= 0 (* 2 v_v_3374_1)) (<= v_v_3376_1 v_v_3374_1) (or (= (select |c_#memory_int| v_idx_224) v_v_3377_1) (< v_idx_224 v_b_261_1)) (or (< v_idx_221 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_221) v_v_3374_1) (<= .cse0 v_idx_221)) (or (<= v_b_261_1 v_idx_223) (< v_idx_223 v_b_260_1) (= (select |c_#memory_int| v_idx_223) v_v_3376_1)) (or (< v_idx_222 .cse0) (= (select |c_#memory_int| v_idx_222) v_v_3375_1) (<= v_b_260_1 v_idx_222)) (<= .cse1 v_b_261_1) (or (= (select |c_#memory_int| v_idx_220) v_v_3373_1) (<= c_ULTIMATE.start_main_p1 v_idx_220)) (<= v_b_261_1 .cse1) (<= .cse0 v_b_260_1) (<= (* 2 v_v_3376_1) 0))))) is different from false [2019-01-18 18:08:32,587 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-18 18:08:32,587 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:08:32,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:08:32,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-18 18:08:32,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:32,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:08:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:08:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:08:32,588 INFO L87 Difference]: Start difference. First operand 10 states and 22 transitions. Second operand 5 states. [2019-01-18 18:08:35,190 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_214 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_210 Int) (v_idx_211 Int)) (exists ((v_v_3377_1 Int) (v_v_3376_1 Int) (v_v_3375_1 Int) (v_v_3374_1 Int) (v_v_3373_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (<= 0 (* 2 v_v_3374_1)) (<= v_v_3376_1 v_v_3374_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_210) (= (select |c_#memory_int| v_idx_210) v_v_3373_1)) (or (<= .cse0 v_idx_211) (< v_idx_211 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_211) v_v_3374_1)) (or (< v_idx_212 .cse0) (= (select |c_#memory_int| v_idx_212) v_v_3375_1) (<= c_ULTIMATE.start_main_p2 v_idx_212)) (or (< v_idx_214 .cse1) (= (select |c_#memory_int| v_idx_214) v_v_3377_1)) (<= .cse0 c_ULTIMATE.start_main_p2) (<= (* 2 v_v_3376_1) 0) (or (= (select |c_#memory_int| v_idx_213) v_v_3376_1) (<= .cse1 v_idx_213) (< v_idx_213 c_ULTIMATE.start_main_p2)))))) (forall ((v_idx_215 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int)) (exists ((v_v_3377_1 Int) (v_v_3376_1 Int) (v_v_3375_1 Int) (v_v_3374_1 Int) (v_v_3373_1 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p2 1))) (and (<= 0 (* 2 v_v_3374_1)) (<= v_v_3376_1 v_v_3374_1) (or (= (select |c_#memory_int| v_idx_217) v_v_3375_1) (< v_idx_217 .cse2) (<= c_ULTIMATE.start_main_p2 v_idx_217)) (or (= (select |c_#memory_int| v_idx_215) v_v_3373_1) (<= c_ULTIMATE.start_main_p1 v_idx_215)) (or (= (select |c_#memory_int| v_idx_219) v_v_3377_1) (< v_idx_219 .cse3)) (or (= (select |c_#memory_int| v_idx_216) v_v_3374_1) (< v_idx_216 c_ULTIMATE.start_main_p1) (<= .cse2 v_idx_216)) (<= .cse2 c_ULTIMATE.start_main_p2) (<= (* 2 v_v_3376_1) 0) (or (< v_idx_218 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_218) v_v_3376_1) (<= .cse3 v_idx_218)))))) (forall ((v_idx_223 Int) (v_idx_224 Int) (v_idx_221 Int) (v_idx_222 Int) (v_idx_220 Int)) (exists ((v_v_3377_1 Int) (v_v_3376_1 Int) (v_b_261_1 Int) (v_b_260_1 Int) (v_v_3375_1 Int) (v_v_3374_1 Int) (v_v_3373_1 Int)) (let ((.cse5 (+ v_b_260_1 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 2) v_b_261_1) (<= 0 (* 2 v_v_3374_1)) (<= v_v_3376_1 v_v_3374_1) (or (= (select |c_#memory_int| v_idx_224) v_v_3377_1) (< v_idx_224 v_b_261_1)) (or (< v_idx_221 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_221) v_v_3374_1) (<= .cse4 v_idx_221)) (or (<= v_b_261_1 v_idx_223) (< v_idx_223 v_b_260_1) (= (select |c_#memory_int| v_idx_223) v_v_3376_1)) (or (< v_idx_222 .cse4) (= (select |c_#memory_int| v_idx_222) v_v_3375_1) (<= v_b_260_1 v_idx_222)) (<= .cse5 v_b_261_1) (or (= (select |c_#memory_int| v_idx_220) v_v_3373_1) (<= c_ULTIMATE.start_main_p1 v_idx_220)) (<= v_b_261_1 .cse5) (<= .cse4 v_b_260_1) (<= (* 2 v_v_3376_1) 0)))))) is different from false [2019-01-18 18:08:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:52,173 INFO L93 Difference]: Finished difference Result 13 states and 29 transitions. [2019-01-18 18:08:52,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:52,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-18 18:08:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:52,174 INFO L225 Difference]: With dead ends: 13 [2019-01-18 18:08:52,174 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 18:08:52,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=9, Invalid=5, Unknown=4, NotChecked=12, Total=30 [2019-01-18 18:08:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 18:08:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-18 18:08:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 18:08:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2019-01-18 18:08:52,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 25 transitions. Word has length 4 [2019-01-18 18:08:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:52,181 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 25 transitions. [2019-01-18 18:08:52,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:08:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 25 transitions. [2019-01-18 18:08:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:52,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:52,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:52,182 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 929672, now seen corresponding path program 1 times [2019-01-18 18:08:52,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:52,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:52,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:08:52,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:08:52,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 18:08:52,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:52,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 18:08:52,290 INFO L87 Difference]: Start difference. First operand 11 states and 25 transitions. Second operand 4 states. [2019-01-18 18:08:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:52,420 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-01-18 18:08:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:52,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 18:08:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:52,421 INFO L225 Difference]: With dead ends: 14 [2019-01-18 18:08:52,422 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 18:08:52,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 18:08:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 18:08:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 18:08:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 18:08:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2019-01-18 18:08:52,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 26 transitions. Word has length 4 [2019-01-18 18:08:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:52,433 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 26 transitions. [2019-01-18 18:08:52,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 26 transitions. [2019-01-18 18:08:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:52,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:52,434 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-18 18:08:52,434 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:52,435 INFO L82 PathProgramCache]: Analyzing trace with hash 931468, now seen corresponding path program 2 times [2019-01-18 18:08:52,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:52,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:52,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:52,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:52,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:52,660 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-18 18:08:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:08:52,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:52,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:52,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:52,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:52,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:52,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:52,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:52,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:52,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 18:08:52,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:52,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:52,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 18:08:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 18:08:52,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-18 18:08:52,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:08:52,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 18:08:52,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-18 18:08:52,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:52,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-18 18:08:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:52,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:52,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:52,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 18:08:52,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:52,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 18:08:52,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 18:08:52,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:52,920 INFO L87 Difference]: Start difference. First operand 12 states and 26 transitions. Second operand 7 states. [2019-01-18 18:08:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:53,066 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. [2019-01-18 18:08:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:53,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-18 18:08:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:53,067 INFO L225 Difference]: With dead ends: 22 [2019-01-18 18:08:53,067 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 18:08:53,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 18:08:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-01-18 18:08:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 18:08:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2019-01-18 18:08:53,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 34 transitions. Word has length 4 [2019-01-18 18:08:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:53,076 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 34 transitions. [2019-01-18 18:08:53,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 18:08:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 34 transitions. [2019-01-18 18:08:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:53,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:53,076 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 18:08:53,077 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:53,077 INFO L82 PathProgramCache]: Analyzing trace with hash 28813922, now seen corresponding path program 2 times [2019-01-18 18:08:53,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:53,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:53,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:53,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:53,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:53,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:53,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:53,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:53,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:53,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:53,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:53,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:53,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:53,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:53,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:53,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:53,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 18:08:53,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 18:08:53,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-18 18:08:53,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-18 18:08:53,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 18:08:53,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:53,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 18:08:53,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:53,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:53,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 18:08:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:53,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:53,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:53,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:08:53,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:53,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:53,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:53,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:53,647 INFO L87 Difference]: Start difference. First operand 15 states and 34 transitions. Second operand 10 states. [2019-01-18 18:08:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:53,993 INFO L93 Difference]: Finished difference Result 27 states and 58 transitions. [2019-01-18 18:08:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:53,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:53,995 INFO L225 Difference]: With dead ends: 27 [2019-01-18 18:08:53,995 INFO L226 Difference]: Without dead ends: 26 [2019-01-18 18:08:53,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:08:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-18 18:08:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 7. [2019-01-18 18:08:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 18:08:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-01-18 18:08:54,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2019-01-18 18:08:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:54,002 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2019-01-18 18:08:54,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2019-01-18 18:08:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:54,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:54,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:54,003 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash 28815970, now seen corresponding path program 1 times [2019-01-18 18:08:54,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:54,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:54,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:54,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:54,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:08:54,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:54,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:54,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:54,167 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-01-18 18:08:54,168 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:54,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:06,069 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:09:06,069 INFO L272 AbstractInterpreter]: Visited 5 different actions 37 times. Merged at 3 different actions 16 times. Widened at 2 different actions 5 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:09:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:06,069 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:09:06,503 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 54.17% of their original sizes. [2019-01-18 18:09:06,504 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:09:09,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_335 Int) (v_idx_336 Int) (v_idx_333 Int) (v_idx_334 Int) (v_idx_337 Int)) (exists ((v_v_3688_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int) (v_v_3685_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (* 2 v_v_3687_2) 0) (<= v_v_3687_2 v_v_3685_2) (or (= (select |c_#memory_int| v_idx_333) v_v_3684_2) (<= c_ULTIMATE.start_main_p1 v_idx_333)) (or (= (select |c_#memory_int| v_idx_337) v_v_3688_2) (< v_idx_337 .cse0)) (<= .cse1 c_ULTIMATE.start_main_p2) (or (< v_idx_335 .cse1) (<= c_ULTIMATE.start_main_p2 v_idx_335) (= (select |c_#memory_int| v_idx_335) v_v_3686_2)) (<= 0 (* 2 v_v_3685_2)) (or (<= .cse0 v_idx_336) (< v_idx_336 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_336) v_v_3687_2)) (or (<= .cse1 v_idx_334) (< v_idx_334 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_334) v_v_3685_2)))))) is different from false [2019-01-18 18:09:18,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_348 Int) (v_idx_349 Int) (v_idx_350 Int) (v_idx_351 Int) (v_idx_352 Int)) (exists ((v_v_4282_1 Int) (v_v_3688_2 Int) (v_b_298_2 Int) (v_b_261_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ v_b_298_2 1))) (and (or (< v_idx_349 v_b_298_2) (= (select |c_#memory_int| v_idx_349) v_v_4282_1) (<= v_b_261_2 v_idx_349)) (<= (* 2 v_v_3687_2) 0) (or (= (select |c_#memory_int| v_idx_352) v_v_3688_2) (< v_idx_352 .cse0)) (<= 0 (* 2 v_v_4282_1)) (or (<= v_b_298_2 v_idx_348) (= (select |c_#memory_int| v_idx_348) v_v_3684_2)) (or (= (select |c_#memory_int| v_idx_350) v_v_3686_2) (< v_idx_350 v_b_261_2) (<= c_ULTIMATE.start_main_p2 v_idx_350)) (or (<= .cse0 v_idx_351) (= (select |c_#memory_int| v_idx_351) v_v_3687_2) (< v_idx_351 c_ULTIMATE.start_main_p2)) (<= v_v_3687_2 v_v_4282_1) (<= .cse1 c_ULTIMATE.start_main_p2) (<= v_b_261_2 .cse1) (<= .cse1 v_b_261_2) (<= v_b_261_2 c_ULTIMATE.start_main_p2))))) is different from false [2019-01-18 18:09:18,832 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-18 18:09:18,833 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:09:18,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:09:18,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2019-01-18 18:09:18,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:18,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:09:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:09:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=7, Unknown=4, NotChecked=10, Total=30 [2019-01-18 18:09:18,834 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 6 states. [2019-01-18 18:09:21,362 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_346 Int) (v_idx_347 Int) (v_idx_344 Int) (v_idx_345 Int) (v_idx_343 Int)) (exists ((v_v_3688_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int) (v_v_3685_2 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_344 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_344) (= (select |c_#memory_int| v_idx_344) v_v_3685_2)) (<= (* 2 v_v_3687_2) 0) (or (< v_idx_345 .cse0) (= (select |c_#memory_int| v_idx_345) v_v_3686_2) (<= c_ULTIMATE.start_main_p2 v_idx_345)) (or (< v_idx_346 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_346) v_v_3687_2) (<= .cse1 v_idx_346)) (<= v_v_3687_2 v_v_3685_2) (or (< v_idx_347 .cse1) (= (select |c_#memory_int| v_idx_347) v_v_3688_2)) (<= .cse0 c_ULTIMATE.start_main_p2) (<= 0 (* 2 v_v_3685_2)) (or (= (select |c_#memory_int| v_idx_343) v_v_3684_2) (<= c_ULTIMATE.start_main_p1 v_idx_343)))))) (forall ((v_idx_335 Int) (v_idx_336 Int) (v_idx_333 Int) (v_idx_334 Int) (v_idx_337 Int)) (exists ((v_v_3688_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int) (v_v_3685_2 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (* 2 v_v_3687_2) 0) (<= v_v_3687_2 v_v_3685_2) (or (= (select |c_#memory_int| v_idx_333) v_v_3684_2) (<= c_ULTIMATE.start_main_p1 v_idx_333)) (or (= (select |c_#memory_int| v_idx_337) v_v_3688_2) (< v_idx_337 .cse2)) (<= .cse3 c_ULTIMATE.start_main_p2) (or (< v_idx_335 .cse3) (<= c_ULTIMATE.start_main_p2 v_idx_335) (= (select |c_#memory_int| v_idx_335) v_v_3686_2)) (<= 0 (* 2 v_v_3685_2)) (or (<= .cse2 v_idx_336) (< v_idx_336 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_336) v_v_3687_2)) (or (<= .cse3 v_idx_334) (< v_idx_334 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_334) v_v_3685_2)))))) (forall ((v_idx_339 Int) (v_idx_338 Int) (v_idx_342 Int) (v_idx_340 Int) (v_idx_341 Int)) (exists ((v_v_3688_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int) (v_v_3685_2 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p2 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1))) (and (or (= (select |c_#memory_int| v_idx_341) v_v_3687_2) (<= .cse4 v_idx_341) (< v_idx_341 c_ULTIMATE.start_main_p2)) (<= (* 2 v_v_3687_2) 0) (or (= (select |c_#memory_int| v_idx_338) v_v_3684_2) (<= c_ULTIMATE.start_main_p1 v_idx_338)) (or (< v_idx_339 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_339) v_v_3685_2) (<= .cse5 v_idx_339)) (<= v_v_3687_2 v_v_3685_2) (or (< v_idx_342 .cse4) (= (select |c_#memory_int| v_idx_342) v_v_3688_2)) (or (= (select |c_#memory_int| v_idx_340) v_v_3686_2) (< v_idx_340 .cse5) (<= c_ULTIMATE.start_main_p2 v_idx_340)) (<= .cse5 c_ULTIMATE.start_main_p2) (<= 0 (* 2 v_v_3685_2)))))) (forall ((v_idx_348 Int) (v_idx_349 Int) (v_idx_350 Int) (v_idx_351 Int) (v_idx_352 Int)) (exists ((v_v_4282_1 Int) (v_v_3688_2 Int) (v_b_298_2 Int) (v_b_261_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p2 1)) (.cse7 (+ v_b_298_2 1))) (and (or (< v_idx_349 v_b_298_2) (= (select |c_#memory_int| v_idx_349) v_v_4282_1) (<= v_b_261_2 v_idx_349)) (<= (* 2 v_v_3687_2) 0) (or (= (select |c_#memory_int| v_idx_352) v_v_3688_2) (< v_idx_352 .cse6)) (<= 0 (* 2 v_v_4282_1)) (or (<= v_b_298_2 v_idx_348) (= (select |c_#memory_int| v_idx_348) v_v_3684_2)) (or (= (select |c_#memory_int| v_idx_350) v_v_3686_2) (< v_idx_350 v_b_261_2) (<= c_ULTIMATE.start_main_p2 v_idx_350)) (or (<= .cse6 v_idx_351) (= (select |c_#memory_int| v_idx_351) v_v_3687_2) (< v_idx_351 c_ULTIMATE.start_main_p2)) (<= v_v_3687_2 v_v_4282_1) (<= .cse7 c_ULTIMATE.start_main_p2) (<= v_b_261_2 .cse7) (<= .cse7 v_b_261_2) (<= v_b_261_2 c_ULTIMATE.start_main_p2)))))) is different from false [2019-01-18 18:09:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:37,532 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-18 18:09:37,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:09:37,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-18 18:09:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:37,533 INFO L225 Difference]: With dead ends: 11 [2019-01-18 18:09:37,533 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 18:09:37,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=11, Invalid=8, Unknown=5, NotChecked=18, Total=42 [2019-01-18 18:09:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 18:09:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-18 18:09:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 18:09:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-18 18:09:37,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 5 [2019-01-18 18:09:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:37,542 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-18 18:09:37,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:09:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-18 18:09:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:09:37,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:37,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:09:37,543 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 2 times [2019-01-18 18:09:37,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:37,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:37,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:37,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:37,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:37,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:37,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:37,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:37,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:09:37,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:09:37,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:09:37,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 18:09:37,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:09:37,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:37,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-18 18:09:37,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:37,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 18:09:37,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:37,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:37,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:37,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-18 18:09:37,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:37,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:37,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:09:37,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:37,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:37,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 18:09:37,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:37,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:37,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:37,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:37,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 18:09:37,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:37,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:37,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-18 18:09:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:37,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:37,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-18 18:09:37,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:37,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:09:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:09:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:37,944 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 9 states. [2019-01-18 18:09:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:38,060 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2019-01-18 18:09:38,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:38,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 18:09:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:38,061 INFO L225 Difference]: With dead ends: 11 [2019-01-18 18:09:38,061 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 18:09:38,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:09:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 18:09:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 18:09:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 18:09:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 18:09:38,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-18 18:09:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:38,063 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 18:09:38,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:09:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 18:09:38,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 18:09:38,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 18:13:11,659 WARN L181 SmtUtils]: Spent 3.56 m on a formula simplification. DAG size of input: 469 DAG size of output: 410 [2019-01-18 18:13:11,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-18 18:13:11,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-18 18:13:11,668 INFO L444 ceAbstractionStarter]: At program point L26-1(lines 25 31) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse2 (- 1))) ULTIMATE.start_main_p1)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p1))) (or (and (or (and (= .cse0 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 2 .cse1)) (= .cse2 0)) (and (forall ((v_idx_346 Int) (v_idx_347 Int) (v_idx_344 Int) (v_idx_345 Int) (v_idx_343 Int)) (exists ((v_v_3688_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int) (v_v_3685_2 Int)) (let ((.cse4 (+ ULTIMATE.start_main_p2 1)) (.cse3 (+ ULTIMATE.start_main_p1 1))) (and (or (< v_idx_344 ULTIMATE.start_main_p1) (<= .cse3 v_idx_344) (= (select |#memory_int| v_idx_344) v_v_3685_2)) (<= (* 2 v_v_3687_2) 0) (or (< v_idx_345 .cse3) (= (select |#memory_int| v_idx_345) v_v_3686_2) (<= ULTIMATE.start_main_p2 v_idx_345)) (or (< v_idx_346 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_346) v_v_3687_2) (<= .cse4 v_idx_346)) (<= v_v_3687_2 v_v_3685_2) (or (< v_idx_347 .cse4) (= (select |#memory_int| v_idx_347) v_v_3688_2)) (<= .cse3 ULTIMATE.start_main_p2) (<= 0 (* 2 v_v_3685_2)) (or (= (select |#memory_int| v_idx_343) v_v_3684_2) (<= ULTIMATE.start_main_p1 v_idx_343)))))) (forall ((v_idx_223 Int) (v_idx_224 Int) (v_idx_221 Int) (v_idx_222 Int) (v_idx_220 Int)) (exists ((v_v_3377_1 Int) (v_v_3376_1 Int) (v_b_261_1 Int) (v_b_260_1 Int) (v_v_3375_1 Int) (v_v_3374_1 Int) (v_v_3373_1 Int)) (let ((.cse6 (+ v_b_260_1 1)) (.cse5 (+ ULTIMATE.start_main_p1 1))) (and (<= (+ ULTIMATE.start_main_p1 2) v_b_261_1) (<= 0 (* 2 v_v_3374_1)) (<= v_v_3376_1 v_v_3374_1) (or (= (select |#memory_int| v_idx_224) v_v_3377_1) (< v_idx_224 v_b_261_1)) (or (< v_idx_221 ULTIMATE.start_main_p1) (= (select |#memory_int| v_idx_221) v_v_3374_1) (<= .cse5 v_idx_221)) (or (<= v_b_261_1 v_idx_223) (< v_idx_223 v_b_260_1) (= (select |#memory_int| v_idx_223) v_v_3376_1)) (or (< v_idx_222 .cse5) (= (select |#memory_int| v_idx_222) v_v_3375_1) (<= v_b_260_1 v_idx_222)) (<= .cse6 v_b_261_1) (or (= (select |#memory_int| v_idx_220) v_v_3373_1) (<= ULTIMATE.start_main_p1 v_idx_220)) (<= v_b_261_1 .cse6) (<= .cse5 v_b_260_1) (<= (* 2 v_v_3376_1) 0))))) (forall ((v_idx_339 Int) (v_idx_338 Int) (v_idx_342 Int) (v_idx_340 Int) (v_idx_341 Int)) (exists ((v_v_3688_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int) (v_v_3685_2 Int)) (let ((.cse7 (+ ULTIMATE.start_main_p2 1)) (.cse8 (+ ULTIMATE.start_main_p1 1))) (and (or (= (select |#memory_int| v_idx_341) v_v_3687_2) (<= .cse7 v_idx_341) (< v_idx_341 ULTIMATE.start_main_p2)) (<= (* 2 v_v_3687_2) 0) (or (= (select |#memory_int| v_idx_338) v_v_3684_2) (<= ULTIMATE.start_main_p1 v_idx_338)) (or (< v_idx_339 ULTIMATE.start_main_p1) (= (select |#memory_int| v_idx_339) v_v_3685_2) (<= .cse8 v_idx_339)) (<= v_v_3687_2 v_v_3685_2) (or (< v_idx_342 .cse7) (= (select |#memory_int| v_idx_342) v_v_3688_2)) (or (= (select |#memory_int| v_idx_340) v_v_3686_2) (< v_idx_340 .cse8) (<= ULTIMATE.start_main_p2 v_idx_340)) (<= .cse8 ULTIMATE.start_main_p2) (<= 0 (* 2 v_v_3685_2)))))) (forall ((v_idx_214 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_210 Int) (v_idx_211 Int)) (exists ((v_v_3377_1 Int) (v_v_3376_1 Int) (v_v_3375_1 Int) (v_v_3374_1 Int) (v_v_3373_1 Int)) (let ((.cse9 (+ ULTIMATE.start_main_p1 1)) (.cse10 (+ ULTIMATE.start_main_p2 1))) (and (<= 0 (* 2 v_v_3374_1)) (<= v_v_3376_1 v_v_3374_1) (or (<= ULTIMATE.start_main_p1 v_idx_210) (= (select |#memory_int| v_idx_210) v_v_3373_1)) (or (<= .cse9 v_idx_211) (< v_idx_211 ULTIMATE.start_main_p1) (= (select |#memory_int| v_idx_211) v_v_3374_1)) (or (< v_idx_212 .cse9) (= (select |#memory_int| v_idx_212) v_v_3375_1) (<= ULTIMATE.start_main_p2 v_idx_212)) (or (< v_idx_214 .cse10) (= (select |#memory_int| v_idx_214) v_v_3377_1)) (<= .cse9 ULTIMATE.start_main_p2) (<= (* 2 v_v_3376_1) 0) (or (= (select |#memory_int| v_idx_213) v_v_3376_1) (<= .cse10 v_idx_213) (< v_idx_213 ULTIMATE.start_main_p2)))))) (forall ((v_idx_335 Int) (v_idx_336 Int) (v_idx_333 Int) (v_idx_334 Int) (v_idx_337 Int)) (exists ((v_v_3688_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int) (v_v_3685_2 Int)) (let ((.cse11 (+ ULTIMATE.start_main_p2 1)) (.cse12 (+ ULTIMATE.start_main_p1 1))) (and (<= (* 2 v_v_3687_2) 0) (<= v_v_3687_2 v_v_3685_2) (or (= (select |#memory_int| v_idx_333) v_v_3684_2) (<= ULTIMATE.start_main_p1 v_idx_333)) (or (= (select |#memory_int| v_idx_337) v_v_3688_2) (< v_idx_337 .cse11)) (<= .cse12 ULTIMATE.start_main_p2) (or (< v_idx_335 .cse12) (<= ULTIMATE.start_main_p2 v_idx_335) (= (select |#memory_int| v_idx_335) v_v_3686_2)) (<= 0 (* 2 v_v_3685_2)) (or (<= .cse11 v_idx_336) (< v_idx_336 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_336) v_v_3687_2)) (or (<= .cse12 v_idx_334) (< v_idx_334 ULTIMATE.start_main_p1) (= (select |#memory_int| v_idx_334) v_v_3685_2)))))) (forall ((v_idx_126 Int) (v_idx_127 Int) (v_idx_124 Int) (v_idx_125 Int) (v_idx_128 Int)) (exists ((v_b_95_2 Int) (v_b_94_2 Int) (v_v_870_2 Int) (v_v_874_2 Int) (v_v_873_2 Int) (v_v_872_2 Int)) (let ((.cse13 (+ ULTIMATE.start_main_p1 1)) (.cse14 (+ v_b_94_2 1))) (and (<= v_v_873_2 0) (or (= (select |#memory_int| v_idx_128) v_v_874_2) (< v_idx_128 v_b_95_2)) (<= .cse13 v_b_94_2) (or (<= ULTIMATE.start_main_p1 v_idx_124) (= (select |#memory_int| v_idx_124) v_v_870_2)) (or (<= .cse13 v_idx_125) (< v_idx_125 ULTIMATE.start_main_p1) (= 0 (select |#memory_int| v_idx_125))) (<= .cse14 v_b_95_2) (or (= v_v_872_2 (select |#memory_int| v_idx_126)) (< v_idx_126 .cse13) (<= v_b_94_2 v_idx_126)) (or (= (select |#memory_int| v_idx_127) v_v_873_2) (< v_idx_127 v_b_94_2) (<= v_b_95_2 v_idx_127)) (<= v_b_95_2 .cse14) (<= (* 2 v_v_873_2) 0) (<= (+ ULTIMATE.start_main_p1 2) v_b_95_2))))) (forall ((v_idx_58 Int) (v_idx_59 Int) (v_idx_56 Int) (v_idx_57 Int) (v_idx_55 Int)) (exists ((v_b_95_1 Int) (v_v_1028_1 Int) (v_v_1027_1 Int) (v_b_94_1 Int) (v_v_1026_1 Int) (v_v_1030_1 Int)) (let ((.cse15 (+ v_b_94_1 1)) (.cse16 (+ ULTIMATE.start_main_p1 1))) (and (<= v_b_95_1 .cse15) (<= (+ ULTIMATE.start_main_p1 2) v_b_95_1) (<= 0 v_v_1027_1) (<= .cse16 v_b_94_1) (or (= 0 (select |#memory_int| v_idx_58)) (< v_idx_58 v_b_94_1) (<= v_b_95_1 v_idx_58)) (<= .cse15 v_b_95_1) (<= 0 (* 2 v_v_1027_1)) (or (<= ULTIMATE.start_main_p1 v_idx_55) (= (select |#memory_int| v_idx_55) v_v_1026_1)) (or (<= v_b_94_1 v_idx_57) (= (select |#memory_int| v_idx_57) v_v_1028_1) (< v_idx_57 .cse16)) (or (< v_idx_56 ULTIMATE.start_main_p1) (<= .cse16 v_idx_56) (= (select |#memory_int| v_idx_56) v_v_1027_1)) (or (< v_idx_59 v_b_95_1) (= (select |#memory_int| v_idx_59) v_v_1030_1)))))) (forall ((v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int)) (exists ((v_b_95_1 Int) (v_v_1028_1 Int) (v_v_1027_1 Int) (v_b_94_1 Int) (v_v_1026_1 Int) (v_v_1030_1 Int)) (let ((.cse17 (+ v_b_94_1 1)) (.cse18 (+ ULTIMATE.start_main_p1 1))) (and (or (= (select |#memory_int| v_idx_64) v_v_1030_1) (< v_idx_64 v_b_95_1)) (or (< v_idx_63 v_b_94_1) (<= v_b_95_1 v_idx_63) (= (select |#memory_int| v_idx_63) 0)) (<= v_b_95_1 .cse17) (<= (+ ULTIMATE.start_main_p1 2) v_b_95_1) (<= 0 v_v_1027_1) (<= .cse18 v_b_94_1) (<= .cse17 v_b_95_1) (<= 0 (* 2 v_v_1027_1)) (or (<= ULTIMATE.start_main_p1 v_idx_60) (= (select |#memory_int| v_idx_60) v_v_1026_1)) (or (<= v_b_94_1 v_idx_62) (= (select |#memory_int| v_idx_62) v_v_1028_1) (< v_idx_62 .cse18)) (or (= (select |#memory_int| v_idx_61) v_v_1027_1) (< v_idx_61 ULTIMATE.start_main_p1) (<= .cse18 v_idx_61)))))) (forall ((v_idx_348 Int) (v_idx_349 Int) (v_idx_350 Int) (v_idx_351 Int) (v_idx_352 Int)) (exists ((v_v_4282_1 Int) (v_v_3688_2 Int) (v_b_298_2 Int) (v_b_261_2 Int) (v_v_3686_2 Int) (v_v_3687_2 Int) (v_v_3684_2 Int)) (let ((.cse19 (+ ULTIMATE.start_main_p2 1)) (.cse20 (+ v_b_298_2 1))) (and (or (< v_idx_349 v_b_298_2) (= (select |#memory_int| v_idx_349) v_v_4282_1) (<= v_b_261_2 v_idx_349)) (<= (* 2 v_v_3687_2) 0) (or (= (select |#memory_int| v_idx_352) v_v_3688_2) (< v_idx_352 .cse19)) (<= 0 (* 2 v_v_4282_1)) (or (<= v_b_298_2 v_idx_348) (= (select |#memory_int| v_idx_348) v_v_3684_2)) (or (= (select |#memory_int| v_idx_350) v_v_3686_2) (< v_idx_350 v_b_261_2) (<= ULTIMATE.start_main_p2 v_idx_350)) (or (<= .cse19 v_idx_351) (= (select |#memory_int| v_idx_351) v_v_3687_2) (< v_idx_351 ULTIMATE.start_main_p2)) (<= v_v_3687_2 v_v_4282_1) (<= .cse20 ULTIMATE.start_main_p2) (<= v_b_261_2 .cse20) (<= .cse20 v_b_261_2) (<= v_b_261_2 ULTIMATE.start_main_p2))))) (forall ((v_idx_119 Int) (v_idx_122 Int) (v_idx_123 Int) (v_idx_120 Int) (v_idx_121 Int)) (exists ((v_v_870_2 Int) (v_v_874_2 Int) (v_v_873_2 Int) (v_v_872_2 Int)) (let ((.cse22 (+ ULTIMATE.start_main_p1 1)) (.cse21 (+ ULTIMATE.start_main_p2 1))) (and (<= v_v_873_2 0) (or (= (select |#memory_int| v_idx_123) v_v_874_2) (< v_idx_123 .cse21)) (or (= (select |#memory_int| v_idx_120) 0) (< v_idx_120 ULTIMATE.start_main_p1) (<= .cse22 v_idx_120)) (or (< v_idx_121 .cse22) (<= ULTIMATE.start_main_p2 v_idx_121) (= v_v_872_2 (select |#memory_int| v_idx_121))) (or (= (select |#memory_int| v_idx_119) v_v_870_2) (<= ULTIMATE.start_main_p1 v_idx_119)) (<= .cse22 ULTIMATE.start_main_p2) (or (<= .cse21 v_idx_122) (= (select |#memory_int| v_idx_122) v_v_873_2) (< v_idx_122 ULTIMATE.start_main_p2)) (<= (* 2 v_v_873_2) 0)))))) (and (or (<= 1 .cse0) (= 0 .cse1)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0))))) [2019-01-18 18:13:11,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2019-01-18 18:13:11,668 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2019-01-18 18:13:11,669 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-01-18 18:13:11,669 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-18 18:13:11,711 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 06:13:11 BoogieIcfgContainer [2019-01-18 18:13:11,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 18:13:11,712 INFO L168 Benchmark]: Toolchain (without parser) took 339547.19 ms. Allocated memory was 141.6 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 109.1 MB in the beginning and 619.9 MB in the end (delta: -510.8 MB). Peak memory consumption was 596.5 MB. Max. memory is 7.1 GB. [2019-01-18 18:13:11,713 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 141.6 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 18:13:11,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.95 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-18 18:13:11,715 INFO L168 Benchmark]: Boogie Preprocessor took 21.58 ms. Allocated memory is still 141.6 MB. Free memory was 106.9 MB in the beginning and 105.8 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:13:11,719 INFO L168 Benchmark]: RCFGBuilder took 310.20 ms. Allocated memory is still 141.6 MB. Free memory was 105.6 MB in the beginning and 96.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-01-18 18:13:11,720 INFO L168 Benchmark]: TraceAbstraction took 339151.15 ms. Allocated memory was 141.6 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 96.1 MB in the beginning and 619.9 MB in the end (delta: -523.7 MB). Peak memory consumption was 583.6 MB. Max. memory is 7.1 GB. [2019-01-18 18:13:11,727 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.24 ms. Allocated memory is still 141.6 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.95 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.58 ms. Allocated memory is still 141.6 MB. Free memory was 106.9 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 310.20 ms. Allocated memory is still 141.6 MB. Free memory was 105.6 MB in the beginning and 96.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 339151.15 ms. Allocated memory was 141.6 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 96.1 MB in the beginning and 619.9 MB in the end (delta: -523.7 MB). Peak memory consumption was 583.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((#memory_int[p1] == 1 && p1 < p2) || 2 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p2] == 0) || ((((((((((forall v_idx_346 : int, v_idx_347 : int, v_idx_344 : int, v_idx_345 : int, v_idx_343 : int :: (exists v_v_3688_2 : int, v_v_3686_2 : int, v_v_3687_2 : int, v_v_3684_2 : int, v_v_3685_2 : int :: (((((((((v_idx_344 < p1 || p1 + 1 <= v_idx_344) || #memory_int[v_idx_344] == v_v_3685_2) && 2 * v_v_3687_2 <= 0) && ((v_idx_345 < p1 + 1 || #memory_int[v_idx_345] == v_v_3686_2) || p2 <= v_idx_345)) && ((v_idx_346 < p2 || #memory_int[v_idx_346] == v_v_3687_2) || p2 + 1 <= v_idx_346)) && v_v_3687_2 <= v_v_3685_2) && (v_idx_347 < p2 + 1 || #memory_int[v_idx_347] == v_v_3688_2)) && p1 + 1 <= p2) && 0 <= 2 * v_v_3685_2) && (#memory_int[v_idx_343] == v_v_3684_2 || p1 <= v_idx_343))) && (forall v_idx_223 : int, v_idx_224 : int, v_idx_221 : int, v_idx_222 : int, v_idx_220 : int :: (exists v_v_3377_1 : int, v_v_3376_1 : int, v_b_261_1 : int, v_b_260_1 : int, v_v_3375_1 : int, v_v_3374_1 : int, v_v_3373_1 : int :: ((((((((((p1 + 2 <= v_b_261_1 && 0 <= 2 * v_v_3374_1) && v_v_3376_1 <= v_v_3374_1) && (#memory_int[v_idx_224] == v_v_3377_1 || v_idx_224 < v_b_261_1)) && ((v_idx_221 < p1 || #memory_int[v_idx_221] == v_v_3374_1) || p1 + 1 <= v_idx_221)) && ((v_b_261_1 <= v_idx_223 || v_idx_223 < v_b_260_1) || #memory_int[v_idx_223] == v_v_3376_1)) && ((v_idx_222 < p1 + 1 || #memory_int[v_idx_222] == v_v_3375_1) || v_b_260_1 <= v_idx_222)) && v_b_260_1 + 1 <= v_b_261_1) && (#memory_int[v_idx_220] == v_v_3373_1 || p1 <= v_idx_220)) && v_b_261_1 <= v_b_260_1 + 1) && p1 + 1 <= v_b_260_1) && 2 * v_v_3376_1 <= 0))) && (forall v_idx_339 : int, v_idx_338 : int, v_idx_342 : int, v_idx_340 : int, v_idx_341 : int :: (exists v_v_3688_2 : int, v_v_3686_2 : int, v_v_3687_2 : int, v_v_3684_2 : int, v_v_3685_2 : int :: (((((((((#memory_int[v_idx_341] == v_v_3687_2 || p2 + 1 <= v_idx_341) || v_idx_341 < p2) && 2 * v_v_3687_2 <= 0) && (#memory_int[v_idx_338] == v_v_3684_2 || p1 <= v_idx_338)) && ((v_idx_339 < p1 || #memory_int[v_idx_339] == v_v_3685_2) || p1 + 1 <= v_idx_339)) && v_v_3687_2 <= v_v_3685_2) && (v_idx_342 < p2 + 1 || #memory_int[v_idx_342] == v_v_3688_2)) && ((#memory_int[v_idx_340] == v_v_3686_2 || v_idx_340 < p1 + 1) || p2 <= v_idx_340)) && p1 + 1 <= p2) && 0 <= 2 * v_v_3685_2))) && (forall v_idx_214 : int, v_idx_212 : int, v_idx_213 : int, v_idx_210 : int, v_idx_211 : int :: (exists v_v_3377_1 : int, v_v_3376_1 : int, v_v_3375_1 : int, v_v_3374_1 : int, v_v_3373_1 : int :: (((((((0 <= 2 * v_v_3374_1 && v_v_3376_1 <= v_v_3374_1) && (p1 <= v_idx_210 || #memory_int[v_idx_210] == v_v_3373_1)) && ((p1 + 1 <= v_idx_211 || v_idx_211 < p1) || #memory_int[v_idx_211] == v_v_3374_1)) && ((v_idx_212 < p1 + 1 || #memory_int[v_idx_212] == v_v_3375_1) || p2 <= v_idx_212)) && (v_idx_214 < p2 + 1 || #memory_int[v_idx_214] == v_v_3377_1)) && p1 + 1 <= p2) && 2 * v_v_3376_1 <= 0) && ((#memory_int[v_idx_213] == v_v_3376_1 || p2 + 1 <= v_idx_213) || v_idx_213 < p2)))) && (forall v_idx_335 : int, v_idx_336 : int, v_idx_333 : int, v_idx_334 : int, v_idx_337 : int :: (exists v_v_3688_2 : int, v_v_3686_2 : int, v_v_3687_2 : int, v_v_3684_2 : int, v_v_3685_2 : int :: (((((((2 * v_v_3687_2 <= 0 && v_v_3687_2 <= v_v_3685_2) && (#memory_int[v_idx_333] == v_v_3684_2 || p1 <= v_idx_333)) && (#memory_int[v_idx_337] == v_v_3688_2 || v_idx_337 < p2 + 1)) && p1 + 1 <= p2) && ((v_idx_335 < p1 + 1 || p2 <= v_idx_335) || #memory_int[v_idx_335] == v_v_3686_2)) && 0 <= 2 * v_v_3685_2) && ((p2 + 1 <= v_idx_336 || v_idx_336 < p2) || #memory_int[v_idx_336] == v_v_3687_2)) && ((p1 + 1 <= v_idx_334 || v_idx_334 < p1) || #memory_int[v_idx_334] == v_v_3685_2)))) && (forall v_idx_126 : int, v_idx_127 : int, v_idx_124 : int, v_idx_125 : int, v_idx_128 : int :: (exists v_b_95_2 : int, v_b_94_2 : int, v_v_870_2 : int, v_v_874_2 : int, v_v_873_2 : int, v_v_872_2 : int :: (((((((((v_v_873_2 <= 0 && (#memory_int[v_idx_128] == v_v_874_2 || v_idx_128 < v_b_95_2)) && p1 + 1 <= v_b_94_2) && (p1 <= v_idx_124 || #memory_int[v_idx_124] == v_v_870_2)) && ((p1 + 1 <= v_idx_125 || v_idx_125 < p1) || 0 == #memory_int[v_idx_125])) && v_b_94_2 + 1 <= v_b_95_2) && ((v_v_872_2 == #memory_int[v_idx_126] || v_idx_126 < p1 + 1) || v_b_94_2 <= v_idx_126)) && ((#memory_int[v_idx_127] == v_v_873_2 || v_idx_127 < v_b_94_2) || v_b_95_2 <= v_idx_127)) && v_b_95_2 <= v_b_94_2 + 1) && 2 * v_v_873_2 <= 0) && p1 + 2 <= v_b_95_2))) && (forall v_idx_58 : int, v_idx_59 : int, v_idx_56 : int, v_idx_57 : int, v_idx_55 : int :: (exists v_b_95_1 : int, v_v_1028_1 : int, v_v_1027_1 : int, v_b_94_1 : int, v_v_1026_1 : int, v_v_1030_1 : int :: (((((((((v_b_95_1 <= v_b_94_1 + 1 && p1 + 2 <= v_b_95_1) && 0 <= v_v_1027_1) && p1 + 1 <= v_b_94_1) && ((0 == #memory_int[v_idx_58] || v_idx_58 < v_b_94_1) || v_b_95_1 <= v_idx_58)) && v_b_94_1 + 1 <= v_b_95_1) && 0 <= 2 * v_v_1027_1) && (p1 <= v_idx_55 || #memory_int[v_idx_55] == v_v_1026_1)) && ((v_b_94_1 <= v_idx_57 || #memory_int[v_idx_57] == v_v_1028_1) || v_idx_57 < p1 + 1)) && ((v_idx_56 < p1 || p1 + 1 <= v_idx_56) || #memory_int[v_idx_56] == v_v_1027_1)) && (v_idx_59 < v_b_95_1 || #memory_int[v_idx_59] == v_v_1030_1)))) && (forall v_idx_63 : int, v_idx_64 : int, v_idx_61 : int, v_idx_62 : int, v_idx_60 : int :: (exists v_b_95_1 : int, v_v_1028_1 : int, v_v_1027_1 : int, v_b_94_1 : int, v_v_1026_1 : int, v_v_1030_1 : int :: ((((((((((#memory_int[v_idx_64] == v_v_1030_1 || v_idx_64 < v_b_95_1) && ((v_idx_63 < v_b_94_1 || v_b_95_1 <= v_idx_63) || #memory_int[v_idx_63] == 0)) && v_b_95_1 <= v_b_94_1 + 1) && p1 + 2 <= v_b_95_1) && 0 <= v_v_1027_1) && p1 + 1 <= v_b_94_1) && v_b_94_1 + 1 <= v_b_95_1) && 0 <= 2 * v_v_1027_1) && (p1 <= v_idx_60 || #memory_int[v_idx_60] == v_v_1026_1)) && ((v_b_94_1 <= v_idx_62 || #memory_int[v_idx_62] == v_v_1028_1) || v_idx_62 < p1 + 1)) && ((#memory_int[v_idx_61] == v_v_1027_1 || v_idx_61 < p1) || p1 + 1 <= v_idx_61)))) && (forall v_idx_348 : int, v_idx_349 : int, v_idx_350 : int, v_idx_351 : int, v_idx_352 : int :: (exists v_v_4282_1 : int, v_v_3688_2 : int, v_b_298_2 : int, v_b_261_2 : int, v_v_3686_2 : int, v_v_3687_2 : int, v_v_3684_2 : int :: ((((((((((((v_idx_349 < v_b_298_2 || #memory_int[v_idx_349] == v_v_4282_1) || v_b_261_2 <= v_idx_349) && 2 * v_v_3687_2 <= 0) && (#memory_int[v_idx_352] == v_v_3688_2 || v_idx_352 < p2 + 1)) && 0 <= 2 * v_v_4282_1) && (v_b_298_2 <= v_idx_348 || #memory_int[v_idx_348] == v_v_3684_2)) && ((#memory_int[v_idx_350] == v_v_3686_2 || v_idx_350 < v_b_261_2) || p2 <= v_idx_350)) && ((p2 + 1 <= v_idx_351 || #memory_int[v_idx_351] == v_v_3687_2) || v_idx_351 < p2)) && v_v_3687_2 <= v_v_4282_1) && v_b_298_2 + 1 <= p2) && v_b_261_2 <= v_b_298_2 + 1) && v_b_298_2 + 1 <= v_b_261_2) && v_b_261_2 <= p2))) && (forall v_idx_119 : int, v_idx_122 : int, v_idx_123 : int, v_idx_120 : int, v_idx_121 : int :: (exists v_v_870_2 : int, v_v_874_2 : int, v_v_873_2 : int, v_v_872_2 : int :: ((((((v_v_873_2 <= 0 && (#memory_int[v_idx_123] == v_v_874_2 || v_idx_123 < p2 + 1)) && ((#memory_int[v_idx_120] == 0 || v_idx_120 < p1) || p1 + 1 <= v_idx_120)) && ((v_idx_121 < p1 + 1 || p2 <= v_idx_121) || v_v_872_2 == #memory_int[v_idx_121])) && (#memory_int[v_idx_119] == v_v_870_2 || p1 <= v_idx_119)) && p1 + 1 <= p2) && ((p2 + 1 <= v_idx_122 || #memory_int[v_idx_122] == v_v_873_2) || v_idx_122 < p2)) && 2 * v_v_873_2 <= 0)))) || ((1 <= #memory_int[p1] || 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 339.0s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 64.4s AutomataDifference, 0.0s DeadEndRemovalTime, 213.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 37 SDslu, 1 SDs, 0 SdLazy, 208 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 29.3s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 926 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5416 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1488 FormulaSimplificationTreeSizeReductionInter, 213.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 59 ConstructedInterpolants, 7 QuantifiedInterpolants, 2414 SizeOfPredicates, 4 NumberOfNonLiveVariables, 62 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 15/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...