java -ea -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-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-824f902 [2018-12-19 12:30:58,867 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 12:30:58,869 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 12:30:58,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 12:30:58,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 12:30:58,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 12:30:58,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 12:30:58,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 12:30:58,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 12:30:58,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 12:30:58,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 12:30:58,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 12:30:58,896 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 12:30:58,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 12:30:58,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 12:30:58,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 12:30:58,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 12:30:58,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 12:30:58,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 12:30:58,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 12:30:58,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 12:30:58,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 12:30:58,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 12:30:58,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 12:30:58,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 12:30:58,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 12:30:58,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 12:30:58,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 12:30:58,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 12:30:58,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 12:30:58,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 12:30:58,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 12:30:58,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 12:30:58,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 12:30:58,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 12:30:58,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 12:30:58,920 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 [2018-12-19 12:30:58,934 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 12:30:58,934 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 12:30:58,935 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 12:30:58,935 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 12:30:58,935 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 12:30:58,935 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 12:30:58,936 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 12:30:58,936 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 12:30:58,936 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 12:30:58,936 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-19 12:30:58,936 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-19 12:30:58,937 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 12:30:58,937 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 12:30:58,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 12:30:58,938 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 12:30:58,938 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 12:30:58,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 12:30:58,938 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 12:30:58,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 12:30:58,939 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 12:30:58,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 12:30:58,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 12:30:58,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 12:30:58,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 12:30:58,939 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 12:30:58,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 12:30:58,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 12:30:58,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 12:30:58,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 12:30:58,941 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 12:30:58,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:30:58,943 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 12:30:58,943 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 12:30:58,943 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 12:30:58,943 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 12:30:58,944 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 12:30:58,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 12:30:58,944 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 12:30:58,944 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 12:30:58,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 12:30:59,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 12:30:59,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 12:30:59,018 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 12:30:59,019 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 12:30:59,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl [2018-12-19 12:30:59,021 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2018-12-19 12:30:59,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 12:30:59,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 12:30:59,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 12:30:59,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 12:30:59,083 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 12:30:59,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 12:30:59,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 12:30:59,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 12:30:59,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 12:30:59,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... [2018-12-19 12:30:59,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 12:30:59,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 12:30:59,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 12:30:59,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 12:30:59,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:30:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-19 12:30:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-19 12:30:59,535 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-19 12:30:59,536 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-19 12:30:59,536 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:30:59 BoogieIcfgContainer [2018-12-19 12:30:59,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 12:30:59,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 12:30:59,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 12:30:59,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 12:30:59,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:30:59" (1/2) ... [2018-12-19 12:30:59,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65db3199 and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:30:59, skipping insertion in model container [2018-12-19 12:30:59,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:30:59" (2/2) ... [2018-12-19 12:30:59,545 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2018-12-19 12:30:59,555 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 12:30:59,562 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-19 12:30:59,576 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-19 12:30:59,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 12:30:59,610 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 12:30:59,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 12:30:59,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 12:30:59,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 12:30:59,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 12:30:59,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 12:30:59,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 12:30:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-19 12:30:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-19 12:30:59,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:30:59,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-19 12:30:59,637 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:30:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:30:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2018-12-19 12:30:59,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:30:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:30:59,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:30:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:30:59,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:30:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:30:59,948 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {12#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:30:59,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {11#false} is VALID [2018-12-19 12:30:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:30:59,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:30:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 12:30:59,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:30:59,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 12:30:59,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:30:59,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:31:00,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:00,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:31:00,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:31:00,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:31:00,015 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-19 12:31:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:00,239 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-19 12:31:00,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:31:00,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 12:31:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:31:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:31:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-19 12:31:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:31:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-19 12:31:00,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2018-12-19 12:31:00,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:00,317 INFO L225 Difference]: With dead ends: 13 [2018-12-19 12:31:00,318 INFO L226 Difference]: Without dead ends: 8 [2018-12-19 12:31:00,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:31:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-19 12:31:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2018-12-19 12:31:00,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:31:00,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 6 states. [2018-12-19 12:31:00,390 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 6 states. [2018-12-19 12:31:00,391 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 6 states. [2018-12-19 12:31:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:00,393 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2018-12-19 12:31:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-19 12:31:00,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:00,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:00,397 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 8 states. [2018-12-19 12:31:00,397 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 8 states. [2018-12-19 12:31:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:00,402 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2018-12-19 12:31:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-19 12:31:00,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:00,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:00,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:31:00,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:31:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:31:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-19 12:31:00,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2018-12-19 12:31:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:31:00,414 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-19 12:31:00,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:31:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-19 12:31:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:31:00,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:31:00,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:31:00,416 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:31:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2018-12-19 12:31:00,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:31:00,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:00,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:00,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:00,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:31:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:00,739 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:31:00,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:31:00,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2018-12-19 12:31:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:00,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:00,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:31:00,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 12:31:00,773 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2018-12-19 12:31:00,839 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-19 12:31:00,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:31:03,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:31:03,446 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:31:03,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:03,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:31:03,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:03,452 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 [2018-12-19 12:31:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:03,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:31:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:03,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:31:03,610 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 [2018-12-19 12:31:03,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-19 12:31:03,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:03,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:03,650 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. [2018-12-19 12:31:03,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-19 12:31:03,656 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:03,657 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, ULTIMATE.start_main_p2]. (= (store (store |v_#memory_int_12| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|) [2018-12-19 12:31:03,657 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:31:03,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:03,812 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 16 treesize of output 5 [2018-12-19 12:31:03,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:03,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:03,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-19 12:31:03,867 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:03,867 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|]. (let ((.cse0 (select |v_#memory_int_13| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_13| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2018-12-19 12:31:03,867 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2018-12-19 12:31:03,876 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:31:03,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {64#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2018-12-19 12:31:03,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {64#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2018-12-19 12:31:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:03,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:31:03,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {55#false} is VALID [2018-12-19 12:31:03,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {71#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {57#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:31:03,919 INFO L273 TraceCheckUtils]: 0: Hoare triple {54#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {71#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2018-12-19 12:31:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:03,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 12:31:03,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2018-12-19 12:31:03,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:31:03,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 12:31:03,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:31:03,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:31:03,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:03,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:31:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:31:03,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-19 12:31:03,954 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-19 12:31:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:04,039 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2018-12-19 12:31:04,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:31:04,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 12:31:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:31:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:31:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-19 12:31:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:31:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-19 12:31:04,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2018-12-19 12:31:04,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:04,108 INFO L225 Difference]: With dead ends: 10 [2018-12-19 12:31:04,108 INFO L226 Difference]: Without dead ends: 9 [2018-12-19 12:31:04,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-19 12:31:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-19 12:31:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-12-19 12:31:04,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:31:04,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 7 states. [2018-12-19 12:31:04,127 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 7 states. [2018-12-19 12:31:04,127 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 7 states. [2018-12-19 12:31:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:04,129 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 12:31:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:31:04,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:04,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:04,129 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 9 states. [2018-12-19 12:31:04,130 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 9 states. [2018-12-19 12:31:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:04,132 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 12:31:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:31:04,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:04,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:04,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:31:04,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:31:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:31:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-12-19 12:31:04,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2018-12-19 12:31:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:31:04,134 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2018-12-19 12:31:04,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:31:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2018-12-19 12:31:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:31:04,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:31:04,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:31:04,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:31:04,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2018-12-19 12:31:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:31:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:04,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:04,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:31:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:04,272 INFO L273 TraceCheckUtils]: 0: Hoare triple {116#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {118#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:31:04,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {118#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {119#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:31:04,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {119#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {117#false} is VALID [2018-12-19 12:31:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:04,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:04,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:31:04,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 12:31:04,298 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2018-12-19 12:31:04,300 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-19 12:31:04,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:31:07,002 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-19 12:31:07,003 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-19 12:31:07,003 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:31:07,004 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:31:07,004 WARN L224 ngHoareTripleChecker]: Pre: {2147483639#(exists ((v_b_11_2 Int) (v_v_23_2 Int) (v_b_6_2 Int) (v_b_10_2 Int) (v_b_15_2 Int) (v_b_14_2 Int) (v_b_7_2 Int) (v_v_29_2 Int) (v_v_17_2 Int)) (and (<= (- c_ULTIMATE.start_malloc_ptr v_b_14_2) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- (- v_v_23_2) v_v_23_2) (- 2)) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- (- c_ULTIMATE.start_main_p2) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- c_ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= (- v_v_17_2 v_v_23_2) (- 1)) (<= (- v_v_23_2 (- v_v_29_2)) 1) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_6_2)) 0) (<= (- (- v_v_17_2) v_v_17_2) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_14_2) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_14_2)) 0) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- v_v_17_2 (- v_v_17_2)) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- v_v_17_2 (- v_v_23_2)) 1) (<= (- (- v_v_23_2) (- v_v_29_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= (- (- v_v_23_2) v_v_29_2) (- 1)) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) 0) (<= (- v_v_29_2 (- v_v_29_2)) 0) (<= (- v_b_11_2 v_b_14_2) 1) (<= (- c_ULTIMATE.start_main_p2 v_b_6_2) 0) (<= (- (- v_b_11_2) (- v_b_14_2)) (- 1)) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (<= (- (- v_v_17_2) (- v_v_29_2)) 0) (forall ((v_idx_69 Int) (v_idx_68 Int) (v_idx_76 Int) (v_idx_77 Int) (v_idx_75 Int) (v_idx_72 Int) (v_idx_73 Int) (v_idx_70 Int) (v_idx_71 Int)) (or (<= v_b_6_2 v_idx_71) (< v_idx_70 v_b_15_2) (<= v_b_14_2 v_idx_68) (<= v_b_7_2 v_idx_72) (and (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72) (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72))) 0) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72)) (- (select |c_#memory_int| v_idx_69))) 0) (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72) (- (select |c_#valid| v_idx_76))) 1) (<= (- (- (select |c_#valid| v_idx_76)) (- (select |c_#memory_int| v_idx_69))) (- 1)) (<= (- (- (select |c_#valid| v_idx_76)) (select |c_#valid| v_idx_76)) (- 2)) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72)) (select |c_#memory_int| v_idx_69)) 0) (<= (- (select |c_#valid| v_idx_76) (- (select |c_#valid| v_idx_76))) 2) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72)) (- (select |c_#valid| v_idx_76))) 1) (<= (- (- (select |c_#valid| v_idx_76)) (select |c_#memory_int| v_idx_69)) (- 1)) (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72) (select |c_#memory_int| v_idx_69)) 0) (<= (- (- (select |c_#memory_int| v_idx_69)) (select |c_#memory_int| v_idx_69)) 0) (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72) (select |c_#valid| v_idx_76)) (- 1)) (<= (- (select |c_#valid| v_idx_76) (- (select |c_#memory_int| v_idx_69))) 1) (<= (- (select |c_#memory_int| v_idx_69) (- (select |c_#memory_int| v_idx_69))) 0) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72)) (select |c_#valid| v_idx_76)) (- 1)) (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72) (- (select |c_#memory_int| v_idx_69))) 0) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72)) (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_72)) 0) (<= (- (select |c_#valid| v_idx_76) (select |c_#memory_int| v_idx_69)) 1)) (< v_idx_73 v_b_7_2) (< v_idx_69 v_b_14_2) (< v_idx_76 v_b_10_2) (< v_idx_77 v_b_11_2) (<= v_b_11_2 v_idx_76) (<= v_b_10_2 v_idx_75) (<= v_b_15_2 v_idx_69) (< v_idx_72 v_b_6_2))) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- v_b_10_2 v_b_14_2) 0) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- v_v_17_2 v_v_29_2) 0) (<= (- (- v_v_29_2) v_v_29_2) 0) (<= (- v_b_10_2 v_b_6_2) 0) (<= (- (- v_v_17_2) v_v_23_2) (- 1)) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_15_2)) 1) (<= (- v_b_14_2 v_b_7_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (<= (- v_v_23_2 v_v_29_2) 1) (<= (- c_ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (<= (- (- v_v_17_2) v_v_29_2) 0) (<= (- v_b_11_2 v_b_6_2) 1) (<= (- v_v_23_2 (- v_v_23_2)) 2) (<= (- (- v_v_17_2) (- v_v_23_2)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_14_2)) 0) (<= (- v_b_14_2 v_b_6_2) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- v_b_14_2 v_b_15_2) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_14_2)) 0) (<= (- (- v_b_14_2) (- v_b_7_2)) 1) (<= (- v_v_17_2 (- v_v_29_2)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_15_2) (- 1))))} [2018-12-19 12:31:07,004 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; [2018-12-19 12:31:07,005 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p2 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p2) (- 1)))) [2018-12-19 12:31:07,005 WARN L230 ngHoareTripleChecker]: Post: {2147483638#(exists ((v_b_11_2 Int) (v_v_23_2 Int) (v_b_6_2 Int) (v_b_10_2 Int) (v_v_32_2 Int) (v_b_15_2 Int) (v_b_7_2 Int) (v_b_16_2 Int) (v_v_17_2 Int)) (and (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- (- v_v_32_2) v_v_32_2) 2) (<= (- (- v_v_23_2) v_v_23_2) (- 2)) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- (- c_ULTIMATE.start_main_p2) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- v_v_23_2) v_v_32_2) 0) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_16_2) 0) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_16_2)) (- 1)) (<= (- c_ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_16_2)) 0) (<= (- v_b_11_2 v_b_16_2) 1) (<= (- v_v_17_2 v_v_23_2) (- 1)) (<= (- c_ULTIMATE.start_main_p2 v_b_16_2) 0) (<= (- (- v_b_16_2) (- v_b_6_2)) 0) (<= (- v_v_23_2 v_v_32_2) 2) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- (- v_v_17_2) (- v_v_32_2)) (- 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- (- v_v_17_2) v_v_32_2) 1) (<= (- (- v_v_17_2) v_v_17_2) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- v_v_17_2 (- v_v_17_2)) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- v_v_17_2 (- v_v_23_2)) 1) (<= (- (- v_b_16_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_6_2) 0) (forall ((v_idx_79 Int) (v_idx_87 Int) (v_idx_88 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_84 Int) (v_idx_81 Int) (v_idx_82 Int) (v_idx_80 Int)) (or (< v_idx_80 v_b_16_2) (<= v_b_10_2 v_idx_86) (< v_idx_87 v_b_10_2) (<= v_b_11_2 v_idx_87) (<= v_b_16_2 v_idx_79) (< v_idx_88 v_b_11_2) (<= v_b_15_2 v_idx_80) (< v_idx_81 v_b_15_2) (<= v_b_7_2 v_idx_83) (<= v_b_6_2 v_idx_82) (< v_idx_84 v_b_7_2) (< v_idx_83 v_b_6_2) (and (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83) (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83))) 0) (<= (- (- (select |c_#memory_int| v_idx_80)) (select |c_#memory_int| v_idx_80)) 2) (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83) (- (select |c_#valid| v_idx_87))) 1) (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83) (select |c_#memory_int| v_idx_80)) 1) (<= (- (- (select |c_#valid| v_idx_87)) (select |c_#valid| v_idx_87)) (- 2)) (<= (- (select |c_#memory_int| v_idx_80) (- (select |c_#memory_int| v_idx_80))) (- 2)) (<= (- (- (select |c_#valid| v_idx_87)) (select |c_#memory_int| v_idx_80)) 0) (<= (- (select |c_#valid| v_idx_87) (- (select |c_#valid| v_idx_87))) 2) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83)) (- (select |c_#valid| v_idx_87))) 1) (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83) (- (select |c_#memory_int| v_idx_80))) (- 1)) (<= (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83) (select |c_#valid| v_idx_87)) (- 1)) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83)) (select |c_#valid| v_idx_87)) (- 1)) (<= (- (select |c_#valid| v_idx_87) (select |c_#memory_int| v_idx_80)) 2) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83)) (- (select |c_#memory_int| v_idx_80))) (- 1)) (<= (- (- (select |c_#valid| v_idx_87)) (- (select |c_#memory_int| v_idx_80))) (- 2)) (<= (- (select |c_#valid| v_idx_87) (- (select |c_#memory_int| v_idx_80))) 0) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83)) (select |c_#memory_int| v_idx_80)) 1) (<= (- (- (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83)) (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_83)) 0)))) (<= (- v_b_16_2 v_b_6_2) 0) (<= (- v_v_17_2 (- v_v_32_2)) (- 1)) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_6_2) 0) (<= (- (- v_b_10_2) (- v_b_16_2)) 0) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_16_2)) 0) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- v_b_15_2 v_b_16_2) 1) (<= (- (- c_ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- v_b_10_2 v_b_6_2) 0) (<= (- (- v_v_17_2) v_v_23_2) (- 1)) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- (- v_v_23_2) (- v_v_32_2)) (- 2)) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (<= (- c_ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (<= (- v_v_17_2 v_v_32_2) 1) (<= (- v_v_32_2 (- v_v_32_2)) (- 2)) (<= (- (- v_b_15_2) (- v_b_16_2)) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (<= (- v_b_11_2 v_b_6_2) 1) (<= (- v_v_23_2 (- v_v_23_2)) 2) (<= (- (- v_v_17_2) (- v_v_23_2)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- v_v_23_2 (- v_v_32_2)) 0) (<= (- v_b_10_2 v_b_16_2) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (<= (- v_b_16_2 v_b_7_2) (- 1))))} [2018-12-19 12:31:07,005 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:31:07,081 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:31:07,081 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:31:08,624 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-19 12:31:09,752 WARN L270 ngHoareTripleChecker]: Pre: {2147483639#(or (and (<= ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_15_2 Int) (v_b_14_2 Int)) (and (<= (- ULTIMATE.start_malloc_ptr v_b_14_2) 0) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_15_2) (<= v_b_14_2 ULTIMATE.start_main_p2) (<= ULTIMATE.start_main_p2 v_b_10_2) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= v_b_10_2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (+ v_b_10_2 1) v_b_11_2) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= v_b_15_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (< v_b_15_2 (+ v_b_14_2 1)) (<= (- ULTIMATE.start_main_p2 v_b_14_2) 0) (<= v_b_10_2 ULTIMATE.start_main_p2) (<= (- (- v_b_10_2) (- v_b_14_2)) 0) (<= ULTIMATE.start_malloc_ptr v_b_14_2) (<= v_b_15_2 v_b_11_2) (<= v_b_11_2 (+ v_b_10_2 1)) (<= (+ v_b_10_2 1) v_b_15_2) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= v_b_11_2 (+ v_b_14_2 1)) (<= v_b_11_2 (+ ULTIMATE.start_malloc_ptr 1)) (forall ((v_prenex_15 Int) (v_prenex_14 Int)) (or (<= v_b_15_2 v_prenex_14) (< v_prenex_15 v_b_10_2) (< v_prenex_14 v_b_14_2) (<= v_b_11_2 v_prenex_15) (<= (- (select |#valid| v_prenex_15) (- (select |#memory_int| v_prenex_14))) 1))) (<= v_b_11_2 v_b_15_2) (<= (- v_b_11_2 v_b_14_2) 1) (<= v_b_10_2 v_b_14_2) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (<= (- (- (select |#valid| v_prenex_2)) (select |#memory_int| v_prenex_1)) (- 1)) (< v_prenex_2 v_b_10_2) (<= v_b_15_2 v_prenex_1) (<= v_b_11_2 v_prenex_2) (< v_prenex_1 v_b_14_2))) (<= v_b_15_2 (+ v_b_10_2 1)) (<= (- (- v_b_11_2) (- v_b_14_2)) (- 1)) (<= (+ v_b_14_2 1) v_b_15_2) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_11_2) (< v_b_11_2 (+ v_b_10_2 1)) (<= v_b_15_2 (+ ULTIMATE.start_main_p2 1)) (<= ULTIMATE.start_main_p2 v_b_14_2) (<= (- v_b_10_2 v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (+ ULTIMATE.start_main_p2 1) v_b_15_2) (<= v_b_11_2 (+ ULTIMATE.start_main_p2 1)) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= v_b_15_2 (+ v_b_14_2 1)) (<= (- (- v_b_14_2) (- v_b_15_2)) 1) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (forall ((v_idx_69 Int) (v_idx_76 Int)) (or (< v_idx_76 v_b_10_2) (<= (- (select |#valid| v_idx_76) (select |#memory_int| v_idx_69)) 1) (<= v_b_11_2 v_idx_76) (<= v_b_15_2 v_idx_69) (< v_idx_69 v_b_14_2))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_14_2)) 0) (<= (+ v_b_14_2 1) v_b_11_2) (forall ((v_prenex_21 Int) (v_prenex_20 Int)) (or (<= (- (- (select |#valid| v_prenex_21)) (- (select |#memory_int| v_prenex_20))) (- 1)) (< v_prenex_20 v_b_14_2) (< v_prenex_21 v_b_10_2) (<= v_b_15_2 v_prenex_20) (<= v_b_11_2 v_prenex_21))) (<= (- v_b_14_2 v_b_15_2) (- 1)) (<= (+ ULTIMATE.start_main_p2 1) v_b_11_2) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_14_2)) 0) (<= v_b_14_2 v_b_10_2) (<= v_b_14_2 ULTIMATE.start_malloc_ptr) (<= ULTIMATE.start_malloc_ptr v_b_10_2) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)))) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p2)) (and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (exists ((v_b_11_2 Int) (v_b_6_2 Int) (v_b_10_2 Int) (v_b_15_2 Int) (v_b_14_2 Int) (v_b_7_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (forall ((v_prenex_3 Int)) (or (<= (- (select |#memory_int| v_prenex_3) (- (select |#memory_int| v_prenex_3))) 0) (< v_prenex_3 v_b_14_2) (<= v_b_15_2 v_prenex_3))) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (< v_b_15_2 (+ v_b_14_2 1)) (<= (- (- v_b_14_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_14_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_14_2)) 0) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (forall ((v_prenex_18 Int) (v_prenex_19 Int)) (or (< v_prenex_18 v_b_14_2) (<= v_b_15_2 v_prenex_18) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_19) (select |#memory_int| v_prenex_18)) 0) (<= v_b_7_2 v_prenex_19) (< v_prenex_19 v_b_6_2))) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (<= v_b_15_2 v_prenex_8) (< v_prenex_9 v_b_6_2) (<= v_b_7_2 v_prenex_9) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_9) (- (select |#memory_int| v_prenex_8))) 0) (< v_prenex_8 v_b_14_2))) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (forall ((v_prenex_15 Int) (v_prenex_14 Int)) (or (<= v_b_15_2 v_prenex_14) (< v_prenex_15 v_b_10_2) (< v_prenex_14 v_b_14_2) (<= v_b_11_2 v_prenex_15) (<= (- (select |#valid| v_prenex_15) (- (select |#memory_int| v_prenex_14))) 1))) (<= (- v_b_11_2 v_b_14_2) 1) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (<= (- (- (select |#valid| v_prenex_2)) (select |#memory_int| v_prenex_1)) (- 1)) (< v_prenex_2 v_b_10_2) (<= v_b_15_2 v_prenex_1) (<= v_b_11_2 v_prenex_2) (< v_prenex_1 v_b_14_2))) (<= (- (- v_b_11_2) (- v_b_14_2)) (- 1)) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- v_b_10_2 v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_6_2) 0) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_15_2)) 1) (<= (- v_b_14_2 v_b_7_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (forall ((v_idx_69 Int) (v_idx_76 Int)) (or (< v_idx_76 v_b_10_2) (<= (- (select |#valid| v_idx_76) (select |#memory_int| v_idx_69)) 1) (<= v_b_11_2 v_idx_76) (<= v_b_15_2 v_idx_69) (< v_idx_69 v_b_14_2))) (<= (- v_b_15_2 v_b_7_2) 0) (<= (- v_b_11_2 v_b_6_2) 1) (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (or (< v_prenex_4 v_b_14_2) (< v_prenex_5 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_5)) (- (select |#memory_int| v_prenex_4))) 0) (<= v_b_15_2 v_prenex_4) (<= v_b_7_2 v_prenex_5))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_14_2)) 0) (forall ((v_prenex_13 Int)) (or (< v_prenex_13 v_b_14_2) (<= (- (- (select |#memory_int| v_prenex_13)) (select |#memory_int| v_prenex_13)) 0) (<= v_b_15_2 v_prenex_13))) (<= (- v_b_14_2 v_b_6_2) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (forall ((v_prenex_21 Int) (v_prenex_20 Int)) (or (<= (- (- (select |#valid| v_prenex_21)) (- (select |#memory_int| v_prenex_20))) (- 1)) (< v_prenex_20 v_b_14_2) (< v_prenex_21 v_b_10_2) (<= v_b_15_2 v_prenex_20) (<= v_b_11_2 v_prenex_21))) (<= (- v_b_14_2 v_b_15_2) (- 1)) (forall ((v_prenex_12 Int) (v_prenex_11 Int)) (or (<= v_b_7_2 v_prenex_12) (< v_prenex_11 v_b_14_2) (<= v_b_15_2 v_prenex_11) (< v_prenex_12 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_12)) (select |#memory_int| v_prenex_11)) 0))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_14_2)) 0) (<= (- (- v_b_14_2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1))))) (and (<= ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (exists ((v_b_6_2 Int) (v_b_15_2 Int) (v_b_14_2 Int) (v_b_7_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_14_2) 0) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_15_2) (<= v_b_6_2 ULTIMATE.start_main_p2) (<= v_b_14_2 ULTIMATE.start_main_p2) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= v_b_15_2 v_b_7_2) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= v_b_6_2 v_b_14_2) (<= v_b_15_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= v_b_6_2 ULTIMATE.start_malloc_ptr) (< v_b_15_2 (+ v_b_14_2 1)) (<= (- (- v_b_14_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_14_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= ULTIMATE.start_malloc_ptr v_b_14_2) (<= (+ v_b_6_2 1) v_b_7_2) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= v_b_7_2 (+ v_b_6_2 1)) (forall ((v_prenex_18 Int) (v_prenex_19 Int)) (or (< v_prenex_18 v_b_14_2) (<= v_b_15_2 v_prenex_18) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_19) (select |#memory_int| v_prenex_18)) 0) (<= v_b_7_2 v_prenex_19) (< v_prenex_19 v_b_6_2))) (<= ULTIMATE.start_main_p2 v_b_6_2) (<= ULTIMATE.start_malloc_ptr v_b_6_2) (<= (+ ULTIMATE.start_main_p2 1) v_b_7_2) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (<= v_b_15_2 v_prenex_8) (< v_prenex_9 v_b_6_2) (<= v_b_7_2 v_prenex_9) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_9) (- (select |#memory_int| v_prenex_8))) 0) (< v_prenex_8 v_b_14_2))) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (+ v_b_6_2 1) v_b_15_2) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= (+ v_b_14_2 1) v_b_15_2) (<= v_b_14_2 v_b_6_2) (<= v_b_7_2 v_b_15_2) (< v_b_7_2 (+ v_b_6_2 1)) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_7_2) (<= v_b_15_2 (+ v_b_6_2 1)) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= v_b_15_2 (+ ULTIMATE.start_main_p2 1)) (<= ULTIMATE.start_main_p2 v_b_14_2) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= v_b_7_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (+ ULTIMATE.start_main_p2 1) v_b_15_2) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= v_b_7_2 (+ ULTIMATE.start_main_p2 1)) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= v_b_15_2 (+ v_b_14_2 1)) (<= (- (- v_b_14_2) (- v_b_15_2)) 1) (<= (- v_b_14_2 v_b_7_2) (- 1)) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (or (< v_prenex_4 v_b_14_2) (< v_prenex_5 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_5)) (- (select |#memory_int| v_prenex_4))) 0) (<= v_b_15_2 v_prenex_4) (<= v_b_7_2 v_prenex_5))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_14_2)) 0) (<= (- v_b_14_2 v_b_6_2) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- v_b_14_2 v_b_15_2) (- 1)) (forall ((v_prenex_12 Int) (v_prenex_11 Int)) (or (<= v_b_7_2 v_prenex_12) (< v_prenex_11 v_b_14_2) (<= v_b_15_2 v_prenex_11) (< v_prenex_12 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_12)) (select |#memory_int| v_prenex_11)) 0))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_14_2)) 0) (<= (- (- v_b_14_2) (- v_b_7_2)) 1) (<= (+ v_b_14_2 1) v_b_7_2) (<= v_b_14_2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (<= v_b_7_2 (+ v_b_14_2 1)))) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p2)) (and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_6_2 Int) (v_b_15_2 Int) (v_b_14_2 Int) (v_b_7_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (forall ((v_prenex_6 Int) (v_prenex_7 Int)) (or (<= v_b_7_2 v_prenex_7) (< v_prenex_6 v_b_10_2) (<= v_b_11_2 v_prenex_6) (< v_prenex_7 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_7)) (select |#valid| v_prenex_6)) (- 1)))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_14_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_14_2)) 0) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (forall ((v_prenex_15 Int) (v_prenex_14 Int)) (or (<= v_b_15_2 v_prenex_14) (< v_prenex_15 v_b_10_2) (< v_prenex_14 v_b_14_2) (<= v_b_11_2 v_prenex_15) (<= (- (select |#valid| v_prenex_15) (- (select |#memory_int| v_prenex_14))) 1))) (<= (- v_b_11_2 v_b_14_2) 1) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (<= (- (- (select |#valid| v_prenex_2)) (select |#memory_int| v_prenex_1)) (- 1)) (< v_prenex_2 v_b_10_2) (<= v_b_15_2 v_prenex_1) (<= v_b_11_2 v_prenex_2) (< v_prenex_1 v_b_14_2))) (<= (- (- v_b_11_2) (- v_b_14_2)) (- 1)) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (< v_b_11_2 (+ v_b_10_2 1)) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- v_b_10_2 v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (forall ((v_prenex_10 Int)) (or (<= (- (- (select |#valid| v_prenex_10)) (select |#valid| v_prenex_10)) (- 2)) (<= v_b_11_2 v_prenex_10) (< v_prenex_10 v_b_10_2))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_6_2) 0) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_15_2)) 1) (<= (- v_b_14_2 v_b_7_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (or (< v_prenex_23 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_23) (select |#valid| v_prenex_22)) (- 1)) (< v_prenex_22 v_b_10_2) (<= v_b_7_2 v_prenex_23) (<= v_b_11_2 v_prenex_22))) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (forall ((v_prenex_16 Int)) (or (<= (- (select |#valid| v_prenex_16) (- (select |#valid| v_prenex_16))) 2) (<= v_b_11_2 v_prenex_16) (< v_prenex_16 v_b_10_2))) (forall ((v_idx_69 Int) (v_idx_76 Int)) (or (< v_idx_76 v_b_10_2) (<= (- (select |#valid| v_idx_76) (select |#memory_int| v_idx_69)) 1) (<= v_b_11_2 v_idx_76) (<= v_b_15_2 v_idx_69) (< v_idx_69 v_b_14_2))) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_25 Int) (v_prenex_24 Int)) (or (<= v_b_7_2 v_prenex_25) (< v_prenex_25 v_b_6_2) (< v_prenex_24 v_b_10_2) (<= v_b_11_2 v_prenex_24) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_25)) (- (select |#valid| v_prenex_24))) 1))) (<= (- v_b_11_2 v_b_6_2) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_14_2)) 0) (<= (- v_b_14_2 v_b_6_2) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (forall ((v_prenex_21 Int) (v_prenex_20 Int)) (or (<= (- (- (select |#valid| v_prenex_21)) (- (select |#memory_int| v_prenex_20))) (- 1)) (< v_prenex_20 v_b_14_2) (< v_prenex_21 v_b_10_2) (<= v_b_15_2 v_prenex_20) (<= v_b_11_2 v_prenex_21))) (<= (- v_b_14_2 v_b_15_2) (- 1)) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_14_2)) 0) (<= (- (- v_b_14_2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (forall ((v_prenex_27 Int) (v_prenex_26 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_27) (- (select |#valid| v_prenex_26))) 1) (<= v_b_11_2 v_prenex_26) (< v_prenex_27 v_b_6_2) (<= v_b_7_2 v_prenex_27) (< v_prenex_26 v_b_10_2)))))) (and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_6_2 Int) (v_b_15_2 Int) (v_b_14_2 Int) (v_b_7_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (forall ((v_prenex_6 Int) (v_prenex_7 Int)) (or (<= v_b_7_2 v_prenex_7) (< v_prenex_6 v_b_10_2) (<= v_b_11_2 v_prenex_6) (< v_prenex_7 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_7)) (select |#valid| v_prenex_6)) (- 1)))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (forall ((v_prenex_3 Int)) (or (<= (- (select |#memory_int| v_prenex_3) (- (select |#memory_int| v_prenex_3))) 0) (< v_prenex_3 v_b_14_2) (<= v_b_15_2 v_prenex_3))) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_14_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_14_2)) 0) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (forall ((v_prenex_18 Int) (v_prenex_19 Int)) (or (< v_prenex_18 v_b_14_2) (<= v_b_15_2 v_prenex_18) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_19) (select |#memory_int| v_prenex_18)) 0) (<= v_b_7_2 v_prenex_19) (< v_prenex_19 v_b_6_2))) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (<= v_b_15_2 v_prenex_8) (< v_prenex_9 v_b_6_2) (<= v_b_7_2 v_prenex_9) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_9) (- (select |#memory_int| v_prenex_8))) 0) (< v_prenex_8 v_b_14_2))) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (forall ((v_prenex_15 Int) (v_prenex_14 Int)) (or (<= v_b_15_2 v_prenex_14) (< v_prenex_15 v_b_10_2) (< v_prenex_14 v_b_14_2) (<= v_b_11_2 v_prenex_15) (<= (- (select |#valid| v_prenex_15) (- (select |#memory_int| v_prenex_14))) 1))) (<= (- v_b_11_2 v_b_14_2) 1) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (or (<= (- (- (select |#valid| v_prenex_2)) (select |#memory_int| v_prenex_1)) (- 1)) (< v_prenex_2 v_b_10_2) (<= v_b_15_2 v_prenex_1) (<= v_b_11_2 v_prenex_2) (< v_prenex_1 v_b_14_2))) (<= (- (- v_b_11_2) (- v_b_14_2)) (- 1)) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- v_b_10_2 v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (forall ((v_prenex_10 Int)) (or (<= (- (- (select |#valid| v_prenex_10)) (select |#valid| v_prenex_10)) (- 2)) (<= v_b_11_2 v_prenex_10) (< v_prenex_10 v_b_10_2))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_6_2) 0) (forall ((v_prenex_17 Int)) (or (< v_prenex_17 v_b_6_2) (<= v_b_7_2 v_prenex_17) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_17)) (select |ULTIMATE.start_malloc_old_#valid| v_prenex_17)) 0))) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_15_2)) 1) (<= (- v_b_14_2 v_b_7_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (or (< v_prenex_23 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_23) (select |#valid| v_prenex_22)) (- 1)) (< v_prenex_22 v_b_10_2) (<= v_b_7_2 v_prenex_23) (<= v_b_11_2 v_prenex_22))) (forall ((v_idx_72 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_idx_72) (- (select |ULTIMATE.start_malloc_old_#valid| v_idx_72))) 0) (<= v_b_7_2 v_idx_72) (< v_idx_72 v_b_6_2))) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (forall ((v_prenex_16 Int)) (or (<= (- (select |#valid| v_prenex_16) (- (select |#valid| v_prenex_16))) 2) (<= v_b_11_2 v_prenex_16) (< v_prenex_16 v_b_10_2))) (forall ((v_idx_69 Int) (v_idx_76 Int)) (or (< v_idx_76 v_b_10_2) (<= (- (select |#valid| v_idx_76) (select |#memory_int| v_idx_69)) 1) (<= v_b_11_2 v_idx_76) (<= v_b_15_2 v_idx_69) (< v_idx_69 v_b_14_2))) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_25 Int) (v_prenex_24 Int)) (or (<= v_b_7_2 v_prenex_25) (< v_prenex_25 v_b_6_2) (< v_prenex_24 v_b_10_2) (<= v_b_11_2 v_prenex_24) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_25)) (- (select |#valid| v_prenex_24))) 1))) (<= (- v_b_11_2 v_b_6_2) 1) (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (or (< v_prenex_4 v_b_14_2) (< v_prenex_5 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_5)) (- (select |#memory_int| v_prenex_4))) 0) (<= v_b_15_2 v_prenex_4) (<= v_b_7_2 v_prenex_5))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_14_2)) 0) (forall ((v_prenex_13 Int)) (or (< v_prenex_13 v_b_14_2) (<= (- (- (select |#memory_int| v_prenex_13)) (select |#memory_int| v_prenex_13)) 0) (<= v_b_15_2 v_prenex_13))) (<= (- v_b_14_2 v_b_6_2) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (forall ((v_prenex_21 Int) (v_prenex_20 Int)) (or (<= (- (- (select |#valid| v_prenex_21)) (- (select |#memory_int| v_prenex_20))) (- 1)) (< v_prenex_20 v_b_14_2) (< v_prenex_21 v_b_10_2) (<= v_b_15_2 v_prenex_20) (<= v_b_11_2 v_prenex_21))) (<= (- v_b_14_2 v_b_15_2) (- 1)) (forall ((v_prenex_12 Int) (v_prenex_11 Int)) (or (<= v_b_7_2 v_prenex_12) (< v_prenex_11 v_b_14_2) (<= v_b_15_2 v_prenex_11) (< v_prenex_12 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_12)) (select |#memory_int| v_prenex_11)) 0))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_14_2)) 0) (<= (- (- v_b_14_2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (forall ((v_prenex_27 Int) (v_prenex_26 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_27) (- (select |#valid| v_prenex_26))) 1) (<= v_b_11_2 v_prenex_26) (< v_prenex_27 v_b_6_2) (<= v_b_7_2 v_prenex_27) (< v_prenex_26 v_b_10_2))))) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0)) (and (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_6_2 Int) (v_b_15_2 Int) (v_b_14_2 Int) (v_b_7_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (forall ((v_prenex_6 Int) (v_prenex_7 Int)) (or (<= v_b_7_2 v_prenex_7) (< v_prenex_6 v_b_10_2) (<= v_b_11_2 v_prenex_6) (< v_prenex_7 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_7)) (select |#valid| v_prenex_6)) (- 1)))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_14_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_14_2)) 0) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (forall ((v_prenex_18 Int) (v_prenex_19 Int)) (or (< v_prenex_18 v_b_14_2) (<= v_b_15_2 v_prenex_18) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_19) (select |#memory_int| v_prenex_18)) 0) (<= v_b_7_2 v_prenex_19) (< v_prenex_19 v_b_6_2))) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (<= v_b_15_2 v_prenex_8) (< v_prenex_9 v_b_6_2) (<= v_b_7_2 v_prenex_9) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_9) (- (select |#memory_int| v_prenex_8))) 0) (< v_prenex_8 v_b_14_2))) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (<= (- v_b_11_2 v_b_14_2) 1) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= (- (- v_b_11_2) (- v_b_14_2)) (- 1)) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (< v_b_7_2 (+ v_b_6_2 1)) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- v_b_10_2 v_b_14_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_6_2) 0) (forall ((v_prenex_17 Int)) (or (< v_prenex_17 v_b_6_2) (<= v_b_7_2 v_prenex_17) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_17)) (select |ULTIMATE.start_malloc_old_#valid| v_prenex_17)) 0))) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_14_2) (- v_b_15_2)) 1) (<= (- v_b_14_2 v_b_7_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (or (< v_prenex_23 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_23) (select |#valid| v_prenex_22)) (- 1)) (< v_prenex_22 v_b_10_2) (<= v_b_7_2 v_prenex_23) (<= v_b_11_2 v_prenex_22))) (forall ((v_idx_72 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_idx_72) (- (select |ULTIMATE.start_malloc_old_#valid| v_idx_72))) 0) (<= v_b_7_2 v_idx_72) (< v_idx_72 v_b_6_2))) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_25 Int) (v_prenex_24 Int)) (or (<= v_b_7_2 v_prenex_25) (< v_prenex_25 v_b_6_2) (< v_prenex_24 v_b_10_2) (<= v_b_11_2 v_prenex_24) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_25)) (- (select |#valid| v_prenex_24))) 1))) (<= (- v_b_11_2 v_b_6_2) 1) (forall ((v_prenex_4 Int) (v_prenex_5 Int)) (or (< v_prenex_4 v_b_14_2) (< v_prenex_5 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_5)) (- (select |#memory_int| v_prenex_4))) 0) (<= v_b_15_2 v_prenex_4) (<= v_b_7_2 v_prenex_5))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_14_2)) 0) (<= (- v_b_14_2 v_b_6_2) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- v_b_14_2 v_b_15_2) (- 1)) (forall ((v_prenex_12 Int) (v_prenex_11 Int)) (or (<= v_b_7_2 v_prenex_12) (< v_prenex_11 v_b_14_2) (<= v_b_15_2 v_prenex_11) (< v_prenex_12 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_12)) (select |#memory_int| v_prenex_11)) 0))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_14_2)) 0) (<= (- (- v_b_14_2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (forall ((v_prenex_27 Int) (v_prenex_26 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_27) (- (select |#valid| v_prenex_26))) 1) (<= v_b_11_2 v_prenex_26) (< v_prenex_27 v_b_6_2) (<= v_b_7_2 v_prenex_27) (< v_prenex_26 v_b_10_2))))) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0)) (and (<= ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_6_2 Int) (v_b_7_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= v_b_6_2 ULTIMATE.start_main_p2) (<= ULTIMATE.start_main_p2 v_b_10_2) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= v_b_10_2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (+ v_b_10_2 1) v_b_11_2) (<= (- v_b_10_2 v_b_11_2) (- 1)) (forall ((v_prenex_6 Int) (v_prenex_7 Int)) (or (<= v_b_7_2 v_prenex_7) (< v_prenex_6 v_b_10_2) (<= v_b_11_2 v_prenex_6) (< v_prenex_7 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_7)) (select |#valid| v_prenex_6)) (- 1)))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (+ v_b_6_2 1) v_b_11_2) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= v_b_6_2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= v_b_10_2 ULTIMATE.start_main_p2) (<= (- v_b_11_2 v_b_7_2) 0) (<= v_b_10_2 v_b_6_2) (<= v_b_11_2 (+ v_b_6_2 1)) (<= v_b_11_2 (+ v_b_10_2 1)) (<= (+ v_b_6_2 1) v_b_7_2) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= v_b_6_2 v_b_10_2) (<= v_b_7_2 (+ v_b_6_2 1)) (<= v_b_11_2 v_b_7_2) (<= ULTIMATE.start_malloc_ptr v_b_6_2) (<= ULTIMATE.start_main_p2 v_b_6_2) (<= (+ ULTIMATE.start_main_p2 1) v_b_7_2) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (<= v_b_11_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (+ v_b_10_2 1) v_b_7_2) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= v_b_7_2 (+ v_b_10_2 1)) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (< v_b_7_2 (+ v_b_6_2 1)) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_7_2) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_11_2) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (< v_b_11_2 (+ v_b_10_2 1)) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= v_b_7_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= v_b_11_2 (+ ULTIMATE.start_main_p2 1)) (<= (- v_b_10_2 v_b_6_2) 0) (<= v_b_7_2 (+ ULTIMATE.start_main_p2 1)) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (or (< v_prenex_23 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_23) (select |#valid| v_prenex_22)) (- 1)) (< v_prenex_22 v_b_10_2) (<= v_b_7_2 v_prenex_23) (<= v_b_11_2 v_prenex_22))) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (<= v_b_7_2 v_b_11_2) (forall ((v_prenex_25 Int) (v_prenex_24 Int)) (or (<= v_b_7_2 v_prenex_25) (< v_prenex_25 v_b_6_2) (< v_prenex_24 v_b_10_2) (<= v_b_11_2 v_prenex_24) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_25)) (- (select |#valid| v_prenex_24))) 1))) (<= (- v_b_11_2 v_b_6_2) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (+ ULTIMATE.start_main_p2 1) v_b_11_2) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= ULTIMATE.start_malloc_ptr v_b_10_2) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (forall ((v_prenex_27 Int) (v_prenex_26 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_27) (- (select |#valid| v_prenex_26))) 1) (<= v_b_11_2 v_prenex_26) (< v_prenex_27 v_b_6_2) (<= v_b_7_2 v_prenex_27) (< v_prenex_26 v_b_10_2))))) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p2)))} [2018-12-19 12:31:09,753 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; [2018-12-19 12:31:09,754 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p2 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p2) (- 1)))) [2018-12-19 12:31:10,764 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-19 12:31:11,466 WARN L276 ngHoareTripleChecker]: Post: {2147483638#(or (and (<= ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_6_2 Int) (v_b_7_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= v_b_6_2 ULTIMATE.start_main_p2) (<= ULTIMATE.start_main_p2 v_b_10_2) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= v_b_10_2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (+ v_b_10_2 1) v_b_11_2) (<= (- v_b_10_2 v_b_11_2) (- 1)) (forall ((v_idx_87 Int) (v_idx_83 Int)) (or (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_idx_83)) (select |#valid| v_idx_87)) (- 1)) (<= v_b_7_2 v_idx_83) (<= v_b_11_2 v_idx_87) (< v_idx_87 v_b_10_2) (< v_idx_83 v_b_6_2))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (+ v_b_6_2 1) v_b_11_2) (forall ((v_prenex_49 Int) (v_prenex_48 Int)) (or (< v_prenex_49 v_b_6_2) (<= v_b_11_2 v_prenex_48) (< v_prenex_48 v_b_10_2) (<= v_b_7_2 v_prenex_49) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_49) (select |#valid| v_prenex_48)) (- 1)))) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= v_b_6_2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= v_b_10_2 ULTIMATE.start_main_p2) (<= (- v_b_11_2 v_b_7_2) 0) (<= v_b_10_2 v_b_6_2) (<= v_b_11_2 (+ v_b_6_2 1)) (<= v_b_11_2 (+ v_b_10_2 1)) (<= (+ v_b_6_2 1) v_b_7_2) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= v_b_7_2 (+ v_b_6_2 1)) (<= v_b_6_2 v_b_10_2) (<= v_b_11_2 v_b_7_2) (<= ULTIMATE.start_malloc_ptr v_b_6_2) (<= ULTIMATE.start_main_p2 v_b_6_2) (<= (+ ULTIMATE.start_main_p2 1) v_b_7_2) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (<= v_b_11_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (+ v_b_10_2 1) v_b_7_2) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= v_b_7_2 (+ v_b_10_2 1)) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (< v_b_7_2 (+ v_b_6_2 1)) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_7_2) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_11_2) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (< v_b_11_2 (+ v_b_10_2 1)) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= v_b_7_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= v_b_11_2 (+ ULTIMATE.start_main_p2 1)) (<= (- v_b_10_2 v_b_6_2) 0) (<= v_b_7_2 (+ ULTIMATE.start_main_p2 1)) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (forall ((v_prenex_43 Int) (v_prenex_42 Int)) (or (<= v_b_7_2 v_prenex_43) (< v_prenex_42 v_b_10_2) (< v_prenex_43 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_43)) (- (select |#valid| v_prenex_42))) 1) (<= v_b_11_2 v_prenex_42))) (forall ((v_prenex_51 Int) (v_prenex_50 Int)) (or (< v_prenex_51 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_51) (- (select |#valid| v_prenex_50))) 1) (<= v_b_7_2 v_prenex_51) (< v_prenex_50 v_b_10_2) (<= v_b_11_2 v_prenex_50))) (<= v_b_7_2 v_b_11_2) (<= (- v_b_11_2 v_b_6_2) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (+ ULTIMATE.start_main_p2 1) v_b_11_2) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= ULTIMATE.start_malloc_ptr v_b_10_2) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)))) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p2)) (and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (exists ((v_b_11_2 Int) (v_b_6_2 Int) (v_b_10_2 Int) (v_b_15_2 Int) (v_b_7_2 Int) (v_b_16_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_16_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_16_2)) (- 1)) (forall ((v_prenex_38 Int) (v_prenex_39 Int)) (or (<= v_b_7_2 v_prenex_38) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_38) (- (select |#memory_int| v_prenex_39))) (- 1)) (< v_prenex_39 v_b_16_2) (< v_prenex_38 v_b_6_2) (<= v_b_15_2 v_prenex_39))) (< v_b_15_2 (+ v_b_16_2 1)) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (forall ((v_prenex_31 Int)) (or (<= v_b_15_2 v_prenex_31) (<= (- (- (select |#memory_int| v_prenex_31)) (select |#memory_int| v_prenex_31)) 2) (< v_prenex_31 v_b_16_2))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_16_2)) 0) (<= (- v_b_11_2 v_b_16_2) 1) (<= (- (- v_b_16_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_16_2) 0) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_16_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= (- v_b_16_2 v_b_6_2) 0) (forall ((v_prenex_28 Int) (v_idx_80 Int)) (or (<= (- (select |#valid| v_prenex_28) (select |#memory_int| v_idx_80)) 2) (< v_idx_80 v_b_16_2) (<= v_b_11_2 v_prenex_28) (< v_prenex_28 v_b_10_2) (<= v_b_15_2 v_idx_80))) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (forall ((v_prenex_54 Int)) (or (<= v_b_15_2 v_prenex_54) (<= (- (select |#memory_int| v_prenex_54) (- (select |#memory_int| v_prenex_54))) (- 2)) (< v_prenex_54 v_b_16_2))) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= (- (- v_b_10_2) (- v_b_16_2)) 0) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_16_2)) 0) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (forall ((v_prenex_52 Int) (v_prenex_53 Int)) (or (< v_prenex_52 v_b_10_2) (<= v_b_11_2 v_prenex_52) (< v_prenex_53 v_b_16_2) (<= v_b_15_2 v_prenex_53) (<= (- (- (select |#valid| v_prenex_52)) (- (select |#memory_int| v_prenex_53))) (- 2)))) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- v_b_15_2 v_b_16_2) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_6_2) 0) (forall ((v_prenex_37 Int) (v_prenex_36 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_36) (select |#memory_int| v_prenex_37)) 1) (<= v_b_15_2 v_prenex_37) (< v_prenex_36 v_b_6_2) (< v_prenex_37 v_b_16_2) (<= v_b_7_2 v_prenex_36))) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (<= (- (- v_b_15_2) (- v_b_16_2)) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_45 Int) (v_prenex_46 Int)) (or (< v_prenex_46 v_b_16_2) (< v_prenex_45 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_45)) (- (select |#memory_int| v_prenex_46))) (- 1)) (<= v_b_7_2 v_prenex_45) (<= v_b_15_2 v_prenex_46))) (<= (- v_b_11_2 v_b_6_2) 1) (forall ((v_prenex_33 Int) (v_prenex_32 Int)) (or (< v_prenex_32 v_b_10_2) (< v_prenex_33 v_b_16_2) (<= v_b_15_2 v_prenex_33) (<= (- (- (select |#valid| v_prenex_32)) (select |#memory_int| v_prenex_33)) 0) (<= v_b_11_2 v_prenex_32))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (forall ((v_prenex_34 Int) (v_prenex_35 Int)) (or (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_34)) (select |#memory_int| v_prenex_35)) 1) (<= v_b_15_2 v_prenex_35) (< v_prenex_35 v_b_16_2) (<= v_b_7_2 v_prenex_34) (< v_prenex_34 v_b_6_2))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_16_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (or (<= v_b_15_2 v_prenex_30) (< v_prenex_29 v_b_10_2) (<= (- (select |#valid| v_prenex_29) (- (select |#memory_int| v_prenex_30))) 0) (<= v_b_11_2 v_prenex_29) (< v_prenex_30 v_b_16_2))) (<= (- v_b_16_2 v_b_7_2) (- 1)))) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0)) (and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_6_2 Int) (v_b_15_2 Int) (v_b_7_2 Int) (v_b_16_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_16_2) 0) (forall ((v_idx_87 Int) (v_idx_83 Int)) (or (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_idx_83)) (select |#valid| v_idx_87)) (- 1)) (<= v_b_7_2 v_idx_83) (<= v_b_11_2 v_idx_87) (< v_idx_87 v_b_10_2) (< v_idx_83 v_b_6_2))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_16_2)) (- 1)) (forall ((v_prenex_38 Int) (v_prenex_39 Int)) (or (<= v_b_7_2 v_prenex_38) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_38) (- (select |#memory_int| v_prenex_39))) (- 1)) (< v_prenex_39 v_b_16_2) (< v_prenex_38 v_b_6_2) (<= v_b_15_2 v_prenex_39))) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_16_2)) 0) (<= (- v_b_11_2 v_b_16_2) 1) (forall ((v_prenex_49 Int) (v_prenex_48 Int)) (or (< v_prenex_49 v_b_6_2) (<= v_b_11_2 v_prenex_48) (< v_prenex_48 v_b_10_2) (<= v_b_7_2 v_prenex_49) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_49) (select |#valid| v_prenex_48)) (- 1)))) (<= (- (- v_b_16_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_16_2) 0) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_16_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= (- v_b_16_2 v_b_6_2) 0) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= (- (- v_b_10_2) (- v_b_16_2)) 0) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_16_2)) 0) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (< v_b_7_2 (+ v_b_6_2 1)) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- v_b_15_2 v_b_16_2) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_6_2) 0) (forall ((v_prenex_37 Int) (v_prenex_36 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_36) (select |#memory_int| v_prenex_37)) 1) (<= v_b_15_2 v_prenex_37) (< v_prenex_36 v_b_6_2) (< v_prenex_37 v_b_16_2) (<= v_b_7_2 v_prenex_36))) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (forall ((v_prenex_43 Int) (v_prenex_42 Int)) (or (<= v_b_7_2 v_prenex_43) (< v_prenex_42 v_b_10_2) (< v_prenex_43 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_43)) (- (select |#valid| v_prenex_42))) 1) (<= v_b_11_2 v_prenex_42))) (forall ((v_prenex_44 Int)) (or (<= v_b_7_2 v_prenex_44) (< v_prenex_44 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_44) (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_44))) 0))) (<= (- (- v_b_15_2) (- v_b_16_2)) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_51 Int) (v_prenex_50 Int)) (or (< v_prenex_51 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_51) (- (select |#valid| v_prenex_50))) 1) (<= v_b_7_2 v_prenex_51) (< v_prenex_50 v_b_10_2) (<= v_b_11_2 v_prenex_50))) (forall ((v_prenex_45 Int) (v_prenex_46 Int)) (or (< v_prenex_46 v_b_16_2) (< v_prenex_45 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_45)) (- (select |#memory_int| v_prenex_46))) (- 1)) (<= v_b_7_2 v_prenex_45) (<= v_b_15_2 v_prenex_46))) (forall ((v_prenex_47 Int)) (or (< v_prenex_47 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_47)) (select |ULTIMATE.start_malloc_old_#valid| v_prenex_47)) 0) (<= v_b_7_2 v_prenex_47))) (<= (- v_b_11_2 v_b_6_2) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (forall ((v_prenex_34 Int) (v_prenex_35 Int)) (or (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_34)) (select |#memory_int| v_prenex_35)) 1) (<= v_b_15_2 v_prenex_35) (< v_prenex_35 v_b_16_2) (<= v_b_7_2 v_prenex_34) (< v_prenex_34 v_b_6_2))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_16_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (<= (- v_b_16_2 v_b_7_2) (- 1)))) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0)) (and (<= ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_15_2 Int) (v_b_16_2 Int)) (and (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_15_2) (<= v_b_16_2 v_b_10_2) (<= ULTIMATE.start_main_p2 v_b_10_2) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= v_b_10_2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (+ v_b_10_2 1) v_b_11_2) (<= ULTIMATE.start_malloc_ptr v_b_16_2) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_16_2) 0) (<= (- (- v_b_11_2) (- v_b_16_2)) (- 1)) (< v_b_15_2 (+ v_b_16_2 1)) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_16_2)) 0) (<= (- v_b_11_2 v_b_16_2) 1) (<= v_b_15_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (- ULTIMATE.start_main_p2 v_b_16_2) 0) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= v_b_16_2 ULTIMATE.start_malloc_ptr) (<= v_b_10_2 ULTIMATE.start_main_p2) (<= v_b_15_2 v_b_11_2) (<= v_b_11_2 (+ v_b_10_2 1)) (<= (+ v_b_10_2 1) v_b_15_2) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (forall ((v_prenex_28 Int) (v_idx_80 Int)) (or (<= (- (select |#valid| v_prenex_28) (select |#memory_int| v_idx_80)) 2) (< v_idx_80 v_b_16_2) (<= v_b_11_2 v_prenex_28) (< v_prenex_28 v_b_10_2) (<= v_b_15_2 v_idx_80))) (<= v_b_11_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= v_b_11_2 v_b_15_2) (<= v_b_15_2 (+ v_b_10_2 1)) (<= (- (- v_b_10_2) (- v_b_16_2)) 0) (<= v_b_15_2 (+ v_b_16_2 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_16_2)) 0) (<= (+ v_b_16_2 1) v_b_15_2) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_11_2) (< v_b_11_2 (+ v_b_10_2 1)) (forall ((v_prenex_52 Int) (v_prenex_53 Int)) (or (< v_prenex_52 v_b_10_2) (<= v_b_11_2 v_prenex_52) (< v_prenex_53 v_b_16_2) (<= v_b_15_2 v_prenex_53) (<= (- (- (select |#valid| v_prenex_52)) (- (select |#memory_int| v_prenex_53))) (- 2)))) (<= v_b_15_2 (+ ULTIMATE.start_main_p2 1)) (<= v_b_10_2 v_b_16_2) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- v_b_15_2 v_b_16_2) 1) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (+ ULTIMATE.start_main_p2 1) v_b_15_2) (<= v_b_11_2 (+ ULTIMATE.start_main_p2 1)) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (<= ULTIMATE.start_main_p2 v_b_16_2) (<= (- (- v_b_15_2) (- v_b_16_2)) (- 1)) (<= v_b_11_2 (+ v_b_16_2 1)) (<= v_b_16_2 ULTIMATE.start_main_p2) (forall ((v_prenex_33 Int) (v_prenex_32 Int)) (or (< v_prenex_32 v_b_10_2) (< v_prenex_33 v_b_16_2) (<= v_b_15_2 v_prenex_33) (<= (- (- (select |#valid| v_prenex_32)) (select |#memory_int| v_prenex_33)) 0) (<= v_b_11_2 v_prenex_32))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (+ v_b_16_2 1) v_b_11_2) (<= (+ ULTIMATE.start_main_p2 1) v_b_11_2) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= ULTIMATE.start_malloc_ptr v_b_10_2) (<= (- v_b_10_2 v_b_16_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (or (<= v_b_15_2 v_prenex_30) (< v_prenex_29 v_b_10_2) (<= (- (select |#valid| v_prenex_29) (- (select |#memory_int| v_prenex_30))) 0) (<= v_b_11_2 v_prenex_29) (< v_prenex_30 v_b_16_2))))) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p2)) (and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_6_2 Int) (v_b_15_2 Int) (v_b_7_2 Int) (v_b_16_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_16_2) 0) (forall ((v_idx_87 Int) (v_idx_83 Int)) (or (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_idx_83)) (select |#valid| v_idx_87)) (- 1)) (<= v_b_7_2 v_idx_83) (<= v_b_11_2 v_idx_87) (< v_idx_87 v_b_10_2) (< v_idx_83 v_b_6_2))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_16_2)) (- 1)) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_16_2)) 0) (<= (- v_b_11_2 v_b_16_2) 1) (forall ((v_prenex_49 Int) (v_prenex_48 Int)) (or (< v_prenex_49 v_b_6_2) (<= v_b_11_2 v_prenex_48) (< v_prenex_48 v_b_10_2) (<= v_b_7_2 v_prenex_49) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_49) (select |#valid| v_prenex_48)) (- 1)))) (<= (- (- v_b_16_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_16_2) 0) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_16_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= (- v_b_16_2 v_b_6_2) 0) (forall ((v_prenex_28 Int) (v_idx_80 Int)) (or (<= (- (select |#valid| v_prenex_28) (select |#memory_int| v_idx_80)) 2) (< v_idx_80 v_b_16_2) (<= v_b_11_2 v_prenex_28) (< v_prenex_28 v_b_10_2) (<= v_b_15_2 v_idx_80))) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= (- (- v_b_10_2) (- v_b_16_2)) 0) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_16_2)) 0) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (< v_b_11_2 (+ v_b_10_2 1)) (forall ((v_prenex_52 Int) (v_prenex_53 Int)) (or (< v_prenex_52 v_b_10_2) (<= v_b_11_2 v_prenex_52) (< v_prenex_53 v_b_16_2) (<= v_b_15_2 v_prenex_53) (<= (- (- (select |#valid| v_prenex_52)) (- (select |#memory_int| v_prenex_53))) (- 2)))) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (forall ((v_prenex_41 Int)) (or (<= v_b_11_2 v_prenex_41) (<= (- (- (select |#valid| v_prenex_41)) (select |#valid| v_prenex_41)) (- 2)) (< v_prenex_41 v_b_10_2))) (<= (- v_b_15_2 v_b_16_2) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_6_2) 0) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (forall ((v_prenex_40 Int)) (or (<= (- (select |#valid| v_prenex_40) (- (select |#valid| v_prenex_40))) 2) (<= v_b_11_2 v_prenex_40) (< v_prenex_40 v_b_10_2))) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (forall ((v_prenex_43 Int) (v_prenex_42 Int)) (or (<= v_b_7_2 v_prenex_43) (< v_prenex_42 v_b_10_2) (< v_prenex_43 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_43)) (- (select |#valid| v_prenex_42))) 1) (<= v_b_11_2 v_prenex_42))) (<= (- (- v_b_15_2) (- v_b_16_2)) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_51 Int) (v_prenex_50 Int)) (or (< v_prenex_51 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_51) (- (select |#valid| v_prenex_50))) 1) (<= v_b_7_2 v_prenex_51) (< v_prenex_50 v_b_10_2) (<= v_b_11_2 v_prenex_50))) (<= (- v_b_11_2 v_b_6_2) 1) (forall ((v_prenex_33 Int) (v_prenex_32 Int)) (or (< v_prenex_32 v_b_10_2) (< v_prenex_33 v_b_16_2) (<= v_b_15_2 v_prenex_33) (<= (- (- (select |#valid| v_prenex_32)) (select |#memory_int| v_prenex_33)) 0) (<= v_b_11_2 v_prenex_32))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_16_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (or (<= v_b_15_2 v_prenex_30) (< v_prenex_29 v_b_10_2) (<= (- (select |#valid| v_prenex_29) (- (select |#memory_int| v_prenex_30))) 0) (<= v_b_11_2 v_prenex_29) (< v_prenex_30 v_b_16_2))) (<= (- v_b_16_2 v_b_7_2) (- 1))))) (and (<= ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (exists ((v_b_6_2 Int) (v_b_15_2 Int) (v_b_7_2 Int) (v_b_16_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_15_2) (<= v_b_6_2 ULTIMATE.start_main_p2) (<= ULTIMATE.start_malloc_ptr v_b_16_2) (<= (- ULTIMATE.start_malloc_ptr v_b_16_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (forall ((v_prenex_38 Int) (v_prenex_39 Int)) (or (<= v_b_7_2 v_prenex_38) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_38) (- (select |#memory_int| v_prenex_39))) (- 1)) (< v_prenex_39 v_b_16_2) (< v_prenex_38 v_b_6_2) (<= v_b_15_2 v_prenex_39))) (< v_b_15_2 (+ v_b_16_2 1)) (<= v_b_7_2 (+ v_b_16_2 1)) (<= v_b_15_2 v_b_7_2) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_16_2)) 0) (<= (- (- v_b_16_2) (- v_b_6_2)) 0) (<= v_b_15_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (- ULTIMATE.start_main_p2 v_b_16_2) 0) (<= v_b_6_2 ULTIMATE.start_malloc_ptr) (<= v_b_16_2 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (+ v_b_6_2 1) v_b_7_2) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_16_2) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= v_b_7_2 (+ v_b_6_2 1)) (<= (- v_b_16_2 v_b_6_2) 0) (<= v_b_16_2 v_b_6_2) (<= ULTIMATE.start_main_p2 v_b_6_2) (<= ULTIMATE.start_malloc_ptr v_b_6_2) (<= (+ ULTIMATE.start_main_p2 1) v_b_7_2) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (+ v_b_16_2 1) v_b_7_2) (<= (+ v_b_6_2 1) v_b_15_2) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= v_b_7_2 v_b_15_2) (<= v_b_15_2 (+ v_b_16_2 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_16_2)) 0) (<= (+ v_b_16_2 1) v_b_15_2) (< v_b_7_2 (+ v_b_6_2 1)) (<= (+ ULTIMATE.start_malloc_ptr 1) v_b_7_2) (<= v_b_15_2 (+ v_b_6_2 1)) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= v_b_15_2 (+ ULTIMATE.start_main_p2 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (<= (- v_b_15_2 v_b_16_2) 1) (<= v_b_7_2 (+ ULTIMATE.start_malloc_ptr 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (+ ULTIMATE.start_main_p2 1) v_b_15_2) (forall ((v_prenex_37 Int) (v_prenex_36 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_36) (select |#memory_int| v_prenex_37)) 1) (<= v_b_15_2 v_prenex_37) (< v_prenex_36 v_b_6_2) (< v_prenex_37 v_b_16_2) (<= v_b_7_2 v_prenex_36))) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= v_b_7_2 (+ ULTIMATE.start_main_p2 1)) (<= v_b_6_2 v_b_16_2) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (<= ULTIMATE.start_main_p2 v_b_16_2) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (<= (- (- v_b_15_2) (- v_b_16_2)) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_45 Int) (v_prenex_46 Int)) (or (< v_prenex_46 v_b_16_2) (< v_prenex_45 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_45)) (- (select |#memory_int| v_prenex_46))) (- 1)) (<= v_b_7_2 v_prenex_45) (<= v_b_15_2 v_prenex_46))) (<= v_b_16_2 ULTIMATE.start_main_p2) (forall ((v_prenex_34 Int) (v_prenex_35 Int)) (or (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_34)) (select |#memory_int| v_prenex_35)) 1) (<= v_b_15_2 v_prenex_35) (< v_prenex_35 v_b_16_2) (<= v_b_7_2 v_prenex_34) (< v_prenex_34 v_b_6_2))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (<= (- v_b_16_2 v_b_7_2) (- 1)))) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p2)) (and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) 0) (<= (- (- ULTIMATE.start_main_p2) (- ULTIMATE.start_malloc_ptr)) 0) (exists ((v_b_11_2 Int) (v_b_10_2 Int) (v_b_6_2 Int) (v_b_15_2 Int) (v_b_7_2 Int) (v_b_16_2 Int)) (and (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_6_2)) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_main_p2 v_b_10_2) 0) (<= (- (- ULTIMATE.start_main_p2) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_16_2) 0) (forall ((v_idx_87 Int) (v_idx_83 Int)) (or (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_idx_83)) (select |#valid| v_idx_87)) (- 1)) (<= v_b_7_2 v_idx_83) (<= v_b_11_2 v_idx_87) (< v_idx_87 v_b_10_2) (< v_idx_83 v_b_6_2))) (<= (- (- ULTIMATE.start_main_p2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_16_2)) (- 1)) (forall ((v_prenex_38 Int) (v_prenex_39 Int)) (or (<= v_b_7_2 v_prenex_38) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_38) (- (select |#memory_int| v_prenex_39))) (- 1)) (< v_prenex_39 v_b_16_2) (< v_prenex_38 v_b_6_2) (<= v_b_15_2 v_prenex_39))) (<= (- ULTIMATE.start_main_p2 v_b_15_2) (- 1)) (forall ((v_prenex_31 Int)) (or (<= v_b_15_2 v_prenex_31) (<= (- (- (select |#memory_int| v_prenex_31)) (select |#memory_int| v_prenex_31)) 2) (< v_prenex_31 v_b_16_2))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_16_2)) 0) (<= (- v_b_11_2 v_b_16_2) 1) (forall ((v_prenex_49 Int) (v_prenex_48 Int)) (or (< v_prenex_49 v_b_6_2) (<= v_b_11_2 v_prenex_48) (< v_prenex_48 v_b_10_2) (<= v_b_7_2 v_prenex_49) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_49) (select |#valid| v_prenex_48)) (- 1)))) (<= (- (- v_b_16_2) (- v_b_6_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_16_2) 0) (<= (- v_b_11_2 v_b_15_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_10_2) 0) (<= (- ULTIMATE.start_main_p2 v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_7_2) (- 1)) (<= (- v_b_11_2 v_b_7_2) 0) (<= (- (- v_b_6_2) (- v_b_7_2)) 1) (<= (- (- v_b_16_2) (- v_b_7_2)) 1) (<= (- (- v_b_10_2) (- v_b_11_2)) 1) (<= (- ULTIMATE.start_malloc_ptr v_b_6_2) 0) (<= (- v_b_16_2 v_b_6_2) 0) (forall ((v_prenex_28 Int) (v_idx_80 Int)) (or (<= (- (select |#valid| v_prenex_28) (select |#memory_int| v_idx_80)) 2) (< v_idx_80 v_b_16_2) (<= v_b_11_2 v_prenex_28) (< v_prenex_28 v_b_10_2) (<= v_b_15_2 v_idx_80))) (<= (- (- v_b_15_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_6_2)) 0) (forall ((v_prenex_54 Int)) (or (<= v_b_15_2 v_prenex_54) (<= (- (select |#memory_int| v_prenex_54) (- (select |#memory_int| v_prenex_54))) (- 2)) (< v_prenex_54 v_b_16_2))) (<= (- ULTIMATE.start_main_p2 v_b_6_2) 0) (<= (- (- v_b_10_2) (- v_b_16_2)) 0) (<= (- v_b_10_2 v_b_7_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_16_2)) 0) (<= (- (- v_b_10_2) (- v_b_7_2)) 1) (<= (- (- v_b_11_2) (- v_b_7_2)) 0) (forall ((v_prenex_52 Int) (v_prenex_53 Int)) (or (< v_prenex_52 v_b_10_2) (<= v_b_11_2 v_prenex_52) (< v_prenex_53 v_b_16_2) (<= v_b_15_2 v_prenex_53) (<= (- (- (select |#valid| v_prenex_52)) (- (select |#memory_int| v_prenex_53))) (- 2)))) (<= (- v_b_15_2 v_b_6_2) 1) (<= (- v_b_6_2 v_b_7_2) (- 1)) (<= (- (- ULTIMATE.start_main_p2) (- v_b_15_2)) 1) (forall ((v_prenex_41 Int)) (or (<= v_b_11_2 v_prenex_41) (<= (- (- (select |#valid| v_prenex_41)) (select |#valid| v_prenex_41)) (- 2)) (< v_prenex_41 v_b_10_2))) (<= (- v_b_15_2 v_b_16_2) 1) (<= (- (- ULTIMATE.start_main_p2) (- v_b_6_2)) 0) (<= (- (- v_b_11_2) (- v_b_6_2)) (- 1)) (<= (- (- v_b_10_2) (- v_b_15_2)) 1) (<= (- v_b_10_2 v_b_6_2) 0) (forall ((v_prenex_37 Int) (v_prenex_36 Int)) (or (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_36) (select |#memory_int| v_prenex_37)) 1) (<= v_b_15_2 v_prenex_37) (< v_prenex_36 v_b_6_2) (< v_prenex_37 v_b_16_2) (<= v_b_7_2 v_prenex_36))) (<= (- (- v_b_15_2) (- v_b_7_2)) 0) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_15_2)) 1) (forall ((v_prenex_40 Int)) (or (<= (- (select |#valid| v_prenex_40) (- (select |#valid| v_prenex_40))) 2) (<= v_b_11_2 v_prenex_40) (< v_prenex_40 v_b_10_2))) (<= (- v_b_10_2 v_b_15_2) (- 1)) (<= (- (- v_b_11_2) (- v_b_15_2)) 0) (<= (- ULTIMATE.start_main_p2 v_b_7_2) (- 1)) (forall ((v_prenex_43 Int) (v_prenex_42 Int)) (or (<= v_b_7_2 v_prenex_43) (< v_prenex_42 v_b_10_2) (< v_prenex_43 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_43)) (- (select |#valid| v_prenex_42))) 1) (<= v_b_11_2 v_prenex_42))) (forall ((v_prenex_44 Int)) (or (<= v_b_7_2 v_prenex_44) (< v_prenex_44 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_44) (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_44))) 0))) (<= (- (- v_b_15_2) (- v_b_16_2)) (- 1)) (<= (- v_b_15_2 v_b_7_2) 0) (forall ((v_prenex_51 Int) (v_prenex_50 Int)) (or (< v_prenex_51 v_b_6_2) (<= (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_51) (- (select |#valid| v_prenex_50))) 1) (<= v_b_7_2 v_prenex_51) (< v_prenex_50 v_b_10_2) (<= v_b_11_2 v_prenex_50))) (forall ((v_prenex_45 Int) (v_prenex_46 Int)) (or (< v_prenex_46 v_b_16_2) (< v_prenex_45 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_45)) (- (select |#memory_int| v_prenex_46))) (- 1)) (<= v_b_7_2 v_prenex_45) (<= v_b_15_2 v_prenex_46))) (forall ((v_prenex_47 Int)) (or (< v_prenex_47 v_b_6_2) (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_47)) (select |ULTIMATE.start_malloc_old_#valid| v_prenex_47)) 0) (<= v_b_7_2 v_prenex_47))) (<= (- v_b_11_2 v_b_6_2) 1) (forall ((v_prenex_33 Int) (v_prenex_32 Int)) (or (< v_prenex_32 v_b_10_2) (< v_prenex_33 v_b_16_2) (<= v_b_15_2 v_prenex_33) (<= (- (- (select |#valid| v_prenex_32)) (select |#memory_int| v_prenex_33)) 0) (<= v_b_11_2 v_prenex_32))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_11_2)) 1) (forall ((v_prenex_34 Int) (v_prenex_35 Int)) (or (<= (- (- (select |ULTIMATE.start_malloc_old_#valid| v_prenex_34)) (select |#memory_int| v_prenex_35)) 1) (<= v_b_15_2 v_prenex_35) (< v_prenex_35 v_b_16_2) (<= v_b_7_2 v_prenex_34) (< v_prenex_34 v_b_6_2))) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_7_2)) 1) (<= (- (- ULTIMATE.start_malloc_ptr) (- v_b_10_2)) 0) (<= (- v_b_10_2 v_b_16_2) 0) (<= (- ULTIMATE.start_malloc_ptr v_b_11_2) (- 1)) (<= (- ULTIMATE.start_malloc_ptr v_b_15_2) (- 1)) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (or (<= v_b_15_2 v_prenex_30) (< v_prenex_29 v_b_10_2) (<= (- (select |#valid| v_prenex_29) (- (select |#memory_int| v_prenex_30))) 0) (<= v_b_11_2 v_prenex_29) (< v_prenex_30 v_b_16_2))) (<= (- v_b_16_2 v_b_7_2) (- 1))))))} [2018-12-19 12:31:12,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:31:12,099 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:31:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:12,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:31:12,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:12,100 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 [2018-12-19 12:31:12,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:12,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:31:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:12,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:31:12,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2018-12-19 12:31:12,261 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 [2018-12-19 12:31:12,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:12,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:12,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-12-19 12:31:12,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:12,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:12,299 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-19 12:31:12,303 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:12,303 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, |v_#valid_4|]. (and (= (select (store |v_#valid_4| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) 0) (= |#memory_int| (store (store |v_#memory_int_15| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0))) [2018-12-19 12:31:12,303 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:31:12,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:12,395 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 [2018-12-19 12:31:12,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:12,441 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. [2018-12-19 12:31:12,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-12-19 12:31:14,662 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:14,662 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_16| ULTIMATE.start_main_p2))) (and (= (store |v_#memory_int_16| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_16| ULTIMATE.start_main_p1)) (= .cse0 0))) [2018-12-19 12:31:14,662 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0)) [2018-12-19 12:31:14,700 INFO L273 TraceCheckUtils]: 0: Hoare triple {116#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {123#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:31:14,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {123#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {127#(and (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2018-12-19 12:31:14,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {127#(and (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {117#false} is VALID [2018-12-19 12:31:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:14,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:31:14,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {131#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {117#false} is VALID [2018-12-19 12:31:14,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {131#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:31:14,877 INFO L273 TraceCheckUtils]: 0: Hoare triple {116#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {135#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:31:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:14,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:31:14,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-19 12:31:14,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:31:14,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 12:31:14,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:31:14,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:31:14,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:14,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:31:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:31:14,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:31:14,909 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-12-19 12:31:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:15,199 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2018-12-19 12:31:15,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 12:31:15,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 12:31:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:31:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:31:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-19 12:31:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:31:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-19 12:31:15,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-12-19 12:31:15,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:15,235 INFO L225 Difference]: With dead ends: 17 [2018-12-19 12:31:15,236 INFO L226 Difference]: Without dead ends: 14 [2018-12-19 12:31:15,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-19 12:31:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-19 12:31:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-19 12:31:15,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:31:15,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 10 states. [2018-12-19 12:31:15,250 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 10 states. [2018-12-19 12:31:15,250 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 10 states. [2018-12-19 12:31:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:15,252 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-19 12:31:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2018-12-19 12:31:15,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:15,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:15,253 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 14 states. [2018-12-19 12:31:15,253 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 14 states. [2018-12-19 12:31:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:15,256 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-19 12:31:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2018-12-19 12:31:15,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:15,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:15,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:31:15,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:31:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:31:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-12-19 12:31:15,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2018-12-19 12:31:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:31:15,258 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2018-12-19 12:31:15,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:31:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2018-12-19 12:31:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:31:15,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:31:15,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:31:15,259 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:31:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2018-12-19 12:31:15,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:31:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:15,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:15,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:31:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:15,343 INFO L273 TraceCheckUtils]: 0: Hoare triple {207#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {209#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2018-12-19 12:31:15,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {209#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {210#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:31:15,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {211#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:31:15,347 INFO L273 TraceCheckUtils]: 3: Hoare triple {211#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {208#false} is VALID [2018-12-19 12:31:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:15,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:15,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:31:15,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:31:15,349 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2018-12-19 12:31:15,350 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-19 12:31:15,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:31:16,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:31:16,679 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:31:16,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:16,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:31:16,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:16,680 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 [2018-12-19 12:31:16,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:16,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:31:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:16,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:31:16,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-12-19 12:31:16,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:16,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2018-12-19 12:31:16,780 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 [2018-12-19 12:31:16,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:16,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:16,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:16,798 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-19 12:31:16,801 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:16,801 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, |v_#valid_5|]. (and (= (select (store |v_#valid_5| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) 0) (= (store (store |v_#memory_int_18| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|)) [2018-12-19 12:31:16,801 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:31:16,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:16,831 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 [2018-12-19 12:31:16,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:16,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:16,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-19 12:31:16,850 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:16,850 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|]. (let ((.cse0 (select |v_#memory_int_19| ULTIMATE.start_main_p1))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_19| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 (select |v_#memory_int_19| ULTIMATE.start_main_p2)) (= .cse0 0))) [2018-12-19 12:31:16,850 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:31:16,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:16,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:16,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:16,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:16,880 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 [2018-12-19 12:31:16,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:16,891 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. [2018-12-19 12:31:16,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-12-19 12:31:19,101 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:19,102 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_20| ULTIMATE.start_main_p2))) (and (= .cse0 0) (= (store |v_#memory_int_20| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= 1 (select |v_#memory_int_20| ULTIMATE.start_main_p1)))) [2018-12-19 12:31:19,102 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:31:19,178 INFO L273 TraceCheckUtils]: 0: Hoare triple {207#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {215#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:31:19,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {219#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:31:19,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {223#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} is VALID [2018-12-19 12:31:19,180 INFO L273 TraceCheckUtils]: 3: Hoare triple {223#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} assume !(#memory_int[main_p1] >= 0); {208#false} is VALID [2018-12-19 12:31:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:19,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:31:19,266 INFO L273 TraceCheckUtils]: 3: Hoare triple {227#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {208#false} is VALID [2018-12-19 12:31:19,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {227#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:31:19,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {231#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:31:19,270 INFO L273 TraceCheckUtils]: 0: Hoare triple {207#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {235#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:31:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:19,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:31:19,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:31:19,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:31:19,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 12:31:19,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:31:19,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:31:19,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:19,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:31:19,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:31:19,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:31:19,347 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2018-12-19 12:31:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:19,681 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-19 12:31:19,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:31:19,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 12:31:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:31:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:31:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-12-19 12:31:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:31:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-12-19 12:31:19,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2018-12-19 12:31:19,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:19,716 INFO L225 Difference]: With dead ends: 18 [2018-12-19 12:31:19,717 INFO L226 Difference]: Without dead ends: 15 [2018-12-19 12:31:19,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:31:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-19 12:31:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2018-12-19 12:31:19,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:31:19,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 6 states. [2018-12-19 12:31:19,743 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 6 states. [2018-12-19 12:31:19,743 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. [2018-12-19 12:31:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:19,746 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2018-12-19 12:31:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2018-12-19 12:31:19,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:19,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:19,747 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 15 states. [2018-12-19 12:31:19,747 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 15 states. [2018-12-19 12:31:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:19,749 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2018-12-19 12:31:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 26 transitions. [2018-12-19 12:31:19,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:19,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:19,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:31:19,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:31:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:31:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-19 12:31:19,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-19 12:31:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:31:19,751 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-19 12:31:19,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:31:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-19 12:31:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:31:19,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:31:19,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:31:19,752 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:31:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2018-12-19 12:31:19,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:31:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:19,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:19,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:31:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:19,911 INFO L273 TraceCheckUtils]: 0: Hoare triple {305#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {307#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:19,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {308#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:31:19,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {308#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {308#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:31:19,913 INFO L273 TraceCheckUtils]: 3: Hoare triple {308#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {306#false} is VALID [2018-12-19 12:31:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:19,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:19,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:31:19,914 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:31:19,914 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2018-12-19 12:31:19,915 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-19 12:31:19,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:31:20,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:31:20,878 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:31:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:20,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:31:20,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:20,879 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 [2018-12-19 12:31:20,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:20,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:31:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:20,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:31:20,909 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 [2018-12-19 12:31:20,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-19 12:31:20,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:20,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:20,928 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. [2018-12-19 12:31:20,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-19 12:31:20,935 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:20,936 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, ULTIMATE.start_main_p1]. (= (store (store |v_#memory_int_23| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) |#memory_int|) [2018-12-19 12:31:20,936 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:31:20,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:20,987 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 16 treesize of output 5 [2018-12-19 12:31:21,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:21,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:21,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-19 12:31:21,017 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:21,017 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|]. (let ((.cse0 (select |v_#memory_int_24| ULTIMATE.start_main_p2))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_24| ULTIMATE.start_main_p2 (+ .cse0 (- 1)))))) [2018-12-19 12:31:21,018 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) [2018-12-19 12:31:21,042 INFO L273 TraceCheckUtils]: 0: Hoare triple {305#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {307#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:21,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {307#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {315#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2018-12-19 12:31:21,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {315#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume #memory_int[main_p1] >= 0; {315#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2018-12-19 12:31:21,046 INFO L273 TraceCheckUtils]: 3: Hoare triple {315#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume !(#memory_int[main_p2] <= 0); {306#false} is VALID [2018-12-19 12:31:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:21,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:31:21,070 INFO L273 TraceCheckUtils]: 3: Hoare triple {322#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {306#false} is VALID [2018-12-19 12:31:21,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {322#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {322#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:21,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {329#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {322#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:21,073 INFO L273 TraceCheckUtils]: 0: Hoare triple {305#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {329#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} is VALID [2018-12-19 12:31:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:21,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 12:31:21,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-19 12:31:21,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:31:21,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-19 12:31:21,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:31:21,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:31:21,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:21,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:31:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:31:21,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:31:21,099 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-19 12:31:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:21,168 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2018-12-19 12:31:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:31:21,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-19 12:31:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:31:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:31:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-19 12:31:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:31:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-19 12:31:21,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2018-12-19 12:31:21,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:21,185 INFO L225 Difference]: With dead ends: 12 [2018-12-19 12:31:21,186 INFO L226 Difference]: Without dead ends: 10 [2018-12-19 12:31:21,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:31:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-19 12:31:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-19 12:31:21,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:31:21,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 8 states. [2018-12-19 12:31:21,218 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 8 states. [2018-12-19 12:31:21,219 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 8 states. [2018-12-19 12:31:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:21,220 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-19 12:31:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2018-12-19 12:31:21,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:21,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:21,221 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 10 states. [2018-12-19 12:31:21,221 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 10 states. [2018-12-19 12:31:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:21,222 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-19 12:31:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2018-12-19 12:31:21,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:21,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:21,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:31:21,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:31:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:31:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-12-19 12:31:21,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2018-12-19 12:31:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:31:21,224 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2018-12-19 12:31:21,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:31:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2018-12-19 12:31:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:31:21,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:31:21,225 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-19 12:31:21,225 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:31:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2018-12-19 12:31:21,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:31:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:21,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:21,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:31:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:21,304 INFO L273 TraceCheckUtils]: 0: Hoare triple {382#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:31:21,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:31:21,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:31:21,308 INFO L273 TraceCheckUtils]: 3: Hoare triple {384#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {385#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:21,309 INFO L273 TraceCheckUtils]: 4: Hoare triple {385#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {383#false} is VALID [2018-12-19 12:31:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-19 12:31:21,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:31:21,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-19 12:31:21,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:31:21,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 12:31:21,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:31:21,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:31:21,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:21,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:31:21,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:31:21,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:31:21,317 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2018-12-19 12:31:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:21,409 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2018-12-19 12:31:21,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:31:21,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 12:31:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:31:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:31:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-19 12:31:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:31:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-19 12:31:21,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2018-12-19 12:31:21,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:21,426 INFO L225 Difference]: With dead ends: 11 [2018-12-19 12:31:21,426 INFO L226 Difference]: Without dead ends: 9 [2018-12-19 12:31:21,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:31:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-19 12:31:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-19 12:31:21,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:31:21,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2018-12-19 12:31:21,472 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2018-12-19 12:31:21,472 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2018-12-19 12:31:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:21,473 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 12:31:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:31:21,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:21,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:21,474 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2018-12-19 12:31:21,475 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2018-12-19 12:31:21,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:21,476 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2018-12-19 12:31:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:31:21,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:21,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:21,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:31:21,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:31:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 12:31:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-19 12:31:21,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2018-12-19 12:31:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:31:21,477 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2018-12-19 12:31:21,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:31:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-19 12:31:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:31:21,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:31:21,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 12:31:21,478 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:31:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2018-12-19 12:31:21,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:31:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:21,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:31:21,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:31:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:21,572 INFO L273 TraceCheckUtils]: 0: Hoare triple {438#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {440#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2018-12-19 12:31:21,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {440#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {441#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:31:21,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {442#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:31:21,580 INFO L273 TraceCheckUtils]: 3: Hoare triple {442#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {442#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:31:21,581 INFO L273 TraceCheckUtils]: 4: Hoare triple {442#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {439#false} is VALID [2018-12-19 12:31:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:21,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:21,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:31:21,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 12:31:21,582 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2018-12-19 12:31:21,585 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-19 12:31:21,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:31:22,597 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:31:22,598 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:31:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:31:22,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:31:22,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:31:22,598 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:31:22,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:31:22,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:31:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:31:22,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:31:22,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-12-19 12:31:22,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:22,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2018-12-19 12:31:22,681 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 [2018-12-19 12:31:22,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:22,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:22,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:22,707 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-19 12:31:22,711 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:22,711 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, |v_#valid_6|]. (and (= |#memory_int| (store (store |v_#memory_int_26| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0)) (= 0 (select (store |v_#valid_6| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2))) [2018-12-19 12:31:22,711 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:31:22,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:22,764 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 [2018-12-19 12:31:22,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:22,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:31:22,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-19 12:31:22,787 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:22,787 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|]. (let ((.cse0 (select |v_#memory_int_27| ULTIMATE.start_main_p2))) (and (= 0 .cse0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_27| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_27| ULTIMATE.start_main_p1) 0))) [2018-12-19 12:31:22,787 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2018-12-19 12:31:22,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:22,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:22,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:22,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:31:22,820 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 [2018-12-19 12:31:22,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:31:22,834 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. [2018-12-19 12:31:22,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2018-12-19 12:31:22,853 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:31:22,854 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_28| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_28| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0) (= 0 (+ (select |v_#memory_int_28| ULTIMATE.start_main_p2) 1)))) [2018-12-19 12:31:22,854 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2018-12-19 12:31:22,895 INFO L273 TraceCheckUtils]: 0: Hoare triple {438#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {446#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:31:22,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {446#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {450#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} is VALID [2018-12-19 12:31:22,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {454#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:31:22,899 INFO L273 TraceCheckUtils]: 3: Hoare triple {454#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {454#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:31:22,900 INFO L273 TraceCheckUtils]: 4: Hoare triple {454#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {439#false} is VALID [2018-12-19 12:31:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:22,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:31:22,978 INFO L273 TraceCheckUtils]: 4: Hoare triple {461#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {439#false} is VALID [2018-12-19 12:31:22,978 INFO L273 TraceCheckUtils]: 3: Hoare triple {461#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {461#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:22,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {468#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {461#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:22,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {472#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {468#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:22,986 INFO L273 TraceCheckUtils]: 0: Hoare triple {438#true} havoc main_p1, main_p2;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0]; {472#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:31:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:31:23,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:31:23,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:31:23,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:31:23,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:31:23,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:31:23,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:31:23,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:23,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:31:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:31:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:31:23,021 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2018-12-19 12:31:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:23,255 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2018-12-19 12:31:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:31:23,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:31:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:31:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:31:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-19 12:31:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:31:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-19 12:31:23,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2018-12-19 12:31:23,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:31:23,282 INFO L225 Difference]: With dead ends: 12 [2018-12-19 12:31:23,282 INFO L226 Difference]: Without dead ends: 0 [2018-12-19 12:31:23,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:31:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-19 12:31:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-19 12:31:23,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:31:23,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-19 12:31:23,283 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:31:23,284 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:31:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:23,284 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:31:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:31:23,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:23,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:23,284 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:31:23,284 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:31:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:31:23,284 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:31:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:31:23,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:23,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:31:23,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:31:23,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:31:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-19 12:31:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-19 12:31:23,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2018-12-19 12:31:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:31:23,286 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-19 12:31:23,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:31:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:31:23,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:31:23,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-19 12:31:23,973 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-12-19 12:31:23,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-19 12:31:23,979 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-12-19 12:31:23,979 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-19 12:31:23,979 INFO L444 ceAbstractionStarter]: At program point L24-1(lines 23 29) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse3 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 .cse3)) (and (= .cse2 0) (= 0 .cse3))))) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse2 1)) ULTIMATE.start_main_p2))) (or (and .cse0 (= 0 .cse1)) (and .cse0 (<= (+ .cse1 1) 0))))) [2018-12-19 12:31:23,979 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2018-12-19 12:31:23,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-12-19 12:31:23,980 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2018-12-19 12:31:23,981 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-19 12:31:23,981 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-19 12:31:23,981 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-12-19 12:31:23,985 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-12-19 12:31:23,985 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-12-19 12:31:23,985 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-19 12:31:23,985 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-19 12:31:23,992 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:31:23 BoogieIcfgContainer [2018-12-19 12:31:23,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-19 12:31:23,993 INFO L168 Benchmark]: Toolchain (without parser) took 24913.60 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 993.0 MB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -967.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2018-12-19 12:31:23,994 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:31:23,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:31:23,995 INFO L168 Benchmark]: Boogie Preprocessor took 28.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:31:23,995 INFO L168 Benchmark]: RCFGBuilder took 359.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-19 12:31:23,996 INFO L168 Benchmark]: TraceAbstraction took 24454.87 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 993.0 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -988.9 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2018-12-19 12:31:23,999 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 359.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24454.87 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 993.0 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -988.9 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 32]: 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: 23]: Loop Invariant Derived loop invariant: (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) || (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 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, 24.3s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 32 SDslu, 1 SDs, 0 SdLazy, 155 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 13.7s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 4 QuantifiedInterpolants, 1521 SizeOfPredicates, 11 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 9/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...