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-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 15:18:47,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 15:18:47,798 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 15:18:47,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 15:18:47,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 15:18:47,814 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 15:18:47,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 15:18:47,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 15:18:47,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 15:18:47,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 15:18:47,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 15:18:47,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 15:18:47,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 15:18:47,834 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 15:18:47,836 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 15:18:47,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 15:18:47,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 15:18:47,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 15:18:47,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 15:18:47,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 15:18:47,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 15:18:47,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 15:18:47,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 15:18:47,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 15:18:47,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 15:18:47,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 15:18:47,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 15:18:47,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 15:18:47,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 15:18:47,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 15:18:47,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 15:18:47,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 15:18:47,865 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 15:18:47,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 15:18:47,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 15:18:47,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 15:18:47,867 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 15:18:47,883 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 15:18:47,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 15:18:47,884 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 15:18:47,885 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 15:18:47,885 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 15:18:47,885 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 15:18:47,885 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 15:18:47,885 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 15:18:47,886 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 15:18:47,886 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 15:18:47,886 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 15:18:47,886 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 15:18:47,886 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 15:18:47,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 15:18:47,888 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 15:18:47,888 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 15:18:47,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 15:18:47,888 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 15:18:47,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 15:18:47,889 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 15:18:47,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 15:18:47,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 15:18:47,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 15:18:47,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 15:18:47,890 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 15:18:47,890 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 15:18:47,890 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 15:18:47,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 15:18:47,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 15:18:47,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 15:18:47,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:18:47,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 15:18:47,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 15:18:47,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 15:18:47,892 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 15:18:47,892 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 15:18:47,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 15:18:47,892 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 15:18:47,893 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 15:18:47,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 15:18:47,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 15:18:47,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 15:18:47,970 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 15:18:47,971 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 15:18:47,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl [2019-01-31 15:18:47,972 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-01-31 15:18:48,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 15:18:48,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 15:18:48,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 15:18:48,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 15:18:48,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 15:18:48,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 15:18:48,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 15:18:48,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 15:18:48,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 15:18:48,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... [2019-01-31 15:18:48,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 15:18:48,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 15:18:48,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 15:18:48,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 15:18:48,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:18:48,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 15:18:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 15:18:49,380 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 15:18:49,381 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-31 15:18:49,382 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:18:49 BoogieIcfgContainer [2019-01-31 15:18:49,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 15:18:49,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 15:18:49,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 15:18:49,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 15:18:49,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:18:48" (1/2) ... [2019-01-31 15:18:49,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6833d49 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:18:49, skipping insertion in model container [2019-01-31 15:18:49,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:18:49" (2/2) ... [2019-01-31 15:18:49,390 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-01-31 15:18:49,400 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 15:18:49,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-31 15:18:49,426 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-31 15:18:49,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 15:18:49,460 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 15:18:49,460 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 15:18:49,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 15:18:49,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 15:18:49,461 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 15:18:49,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 15:18:49,461 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 15:18:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-31 15:18:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 15:18:49,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:18:49,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 15:18:49,486 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:18:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:18:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-01-31 15:18:49,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:18:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:18:49,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:18:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:18:49,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:18:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:18:49,772 INFO L273 TraceCheckUtils]: 0: Hoare triple {24#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;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_p3 := 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_p4 := 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_p5 := 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_p6 := 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_p7 := 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_p8 := 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_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 15:18:49,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {25#false} is VALID [2019-01-31 15:18:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:18:49,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:18:49,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 15:18:49,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:18:49,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 15:18:49,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:18:49,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:18:49,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:18:49,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:18:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:18:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:18:49,859 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-01-31 15:18:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:18:50,212 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-01-31 15:18:50,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:18:50,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 15:18:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:18:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:18:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-01-31 15:18:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:18:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-01-31 15:18:50,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2019-01-31 15:18:50,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:18:50,597 INFO L225 Difference]: With dead ends: 41 [2019-01-31 15:18:50,598 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 15:18:50,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:18:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 15:18:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-01-31 15:18:50,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:18:50,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2019-01-31 15:18:50,629 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2019-01-31 15:18:50,629 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2019-01-31 15:18:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:18:50,635 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-01-31 15:18:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-01-31 15:18:50,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:18:50,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:18:50,636 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2019-01-31 15:18:50,636 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2019-01-31 15:18:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:18:50,641 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-01-31 15:18:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-01-31 15:18:50,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:18:50,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:18:50,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:18:50,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:18:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 15:18:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-01-31 15:18:50,646 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-01-31 15:18:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:18:50,647 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-01-31 15:18:50,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:18:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-01-31 15:18:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:18:50,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:18:50,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:18:50,648 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:18:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:18:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-01-31 15:18:50,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:18:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:18:50,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:18:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:18:50,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:18:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:18:50,850 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;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_p3 := 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_p4 := 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_p5 := 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_p6 := 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_p7 := 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_p8 := 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_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {168#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2019-01-31 15:18:50,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 15:18:50,866 INFO L273 TraceCheckUtils]: 2: Hoare triple {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-01-31 15:18:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:18:50,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:18:50,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:18:50,867 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 15:18:50,869 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-01-31 15:18:50,921 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:18:50,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:18:56,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:18:56,979 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:18:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:18:56,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:18:56,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:18:56,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 15:18:56,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:18:56,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:18:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:18:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:18:57,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:18:57,172 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 30 treesize of output 33 [2019-01-31 15:18:57,183 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-01-31 15:18:57,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-01-31 15:18:57,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-01-31 15:18:57,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-01-31 15:18:57,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 15:18:57,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-31 15:18:57,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:57,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-01-31 15:18:57,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 15:18:57,481 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 15:18:57,578 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:57,763 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:57,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:57,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:57,942 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:57,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:58,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:58,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:58,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 114 [2019-01-31 15:18:58,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-01-31 15:18:58,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2019-01-31 15:18:58,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-01-31 15:18:58,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-01-31 15:18:58,805 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-31 15:18:58,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:58,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-01-31 15:18:59,011 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 15:18:59,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:18:59,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 15:18:59,136 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 15:18:59,200 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:59,277 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:59,356 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:59,442 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:59,530 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:59,604 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:18:59,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 15:18:59,742 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 15:19:10,160 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:19:10,160 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p9, |v_#valid_11|]. (let ((.cse1 (store |v_#valid_11| ULTIMATE.start_main_p1 1))) (let ((.cse3 (store .cse1 ULTIMATE.start_main_p2 1))) (let ((.cse2 (store .cse3 ULTIMATE.start_main_p3 1))) (let ((.cse0 (store .cse2 ULTIMATE.start_main_p4 1))) (let ((.cse4 (store .cse0 ULTIMATE.start_main_p5 1))) (let ((.cse5 (store .cse4 ULTIMATE.start_main_p6 1))) (and (= (select .cse0 ULTIMATE.start_main_p5) 0) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (= (select .cse2 ULTIMATE.start_main_p4) 0) (= (select .cse3 ULTIMATE.start_main_p3) 0) (= 0 (select .cse4 ULTIMATE.start_main_p6)) (= (store (store (store (store (store (store (store (store (store |v_#memory_int_47| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) |#memory_int|) (= (select (store .cse5 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (= (select .cse5 ULTIMATE.start_main_p7) 0)))))))) [2019-01-31 15:19:10,161 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-01-31 15:19:14,402 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-01-31 15:19:14,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:19:14,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-01-31 15:19:14,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:19:14,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 15:19:14,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-01-31 15:19:24,899 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:19:24,899 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_main_p4))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= (store |v_#memory_int_48| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 .cse0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2019-01-31 15:19:24,899 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-01-31 15:19:27,613 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;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_p3 := 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_p4 := 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_p5 := 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_p6 := 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_p7 := 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_p8 := 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_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {173#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2019-01-31 15:19:28,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {173#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {177#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} is VALID [2019-01-31 15:19:28,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-01-31 15:19:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:19:28,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:19:28,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {181#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-01-31 15:19:28,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {181#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:19:28,415 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;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_p3 := 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_p4 := 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_p5 := 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_p6 := 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_p7 := 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_p8 := 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_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {185#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:19:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:19:28,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:19:28,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 15:19:28,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:19:28,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 15:19:28,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:19:28,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 15:19:29,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:19:29,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 15:19:29,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 15:19:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:19:29,643 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2019-01-31 15:19:30,573 WARN L181 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-01-31 15:19:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:19:31,665 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-01-31 15:19:31,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 15:19:31,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 15:19:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:19:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:19:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2019-01-31 15:19:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:19:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2019-01-31 15:19:31,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2019-01-31 15:19:56,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:19:56,806 INFO L225 Difference]: With dead ends: 71 [2019-01-31 15:19:56,807 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 15:19:56,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 15:19:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 15:19:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-01-31 15:19:56,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:19:56,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 24 states. [2019-01-31 15:19:56,896 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 24 states. [2019-01-31 15:19:56,897 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 24 states. [2019-01-31 15:19:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:19:56,904 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2019-01-31 15:19:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2019-01-31 15:19:56,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:19:56,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:19:56,906 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 69 states. [2019-01-31 15:19:56,906 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 69 states. [2019-01-31 15:19:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:19:56,913 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2019-01-31 15:19:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2019-01-31 15:19:56,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:19:56,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:19:56,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:19:56,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:19:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 15:19:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2019-01-31 15:19:56,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 3 [2019-01-31 15:19:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:19:56,921 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 52 transitions. [2019-01-31 15:19:56,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 15:19:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 52 transitions. [2019-01-31 15:19:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:19:56,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:19:56,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:19:56,922 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:19:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:19:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash 30884, now seen corresponding path program 1 times [2019-01-31 15:19:56,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:19:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:19:56,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:19:56,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:19:56,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:19:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:19:57,094 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;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_p3 := 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_p4 := 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_p5 := 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_p6 := 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_p7 := 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_p8 := 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_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {432#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p8) 0))} is VALID [2019-01-31 15:19:57,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {432#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p8) 0))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 15:19:57,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-01-31 15:19:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:19:57,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:19:57,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:19:57,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 15:19:57,099 INFO L207 CegarAbsIntRunner]: [0], [34], [39] [2019-01-31 15:19:57,101 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:19:57,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:20:01,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:20:01,386 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:20:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:20:01,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:20:01,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:20:01,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 15:20:01,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:20:01,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:20:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:20:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:20:01,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:20:01,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 114 [2019-01-31 15:20:01,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-01-31 15:20:01,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2019-01-31 15:20:01,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-01-31 15:20:01,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:01,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-01-31 15:20:02,093 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-31 15:20:02,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-01-31 15:20:02,298 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 15:20:02,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:02,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 15:20:02,352 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 15:20:02,428 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:02,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:02,572 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:02,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:02,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:02,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:02,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-01-31 15:20:02,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-01-31 15:20:02,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-01-31 15:20:02,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-01-31 15:20:02,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-01-31 15:20:02,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 15:20:03,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-31 15:20:03,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-01-31 15:20:03,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 15:20:03,121 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,205 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,269 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,319 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,359 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,391 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,415 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,436 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,458 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:20:03,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 15:20:03,587 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 15:20:14,026 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:20:14,026 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p9, |v_#valid_12|]. (let ((.cse4 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse0 (store .cse4 ULTIMATE.start_main_p2 1))) (let ((.cse5 (store .cse0 ULTIMATE.start_main_p3 1))) (let ((.cse3 (store .cse5 ULTIMATE.start_main_p4 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p5 1))) (let ((.cse2 (store .cse1 ULTIMATE.start_main_p6 1))) (and (= (store (store (store (store (store (store (store (store (store |v_#memory_int_50| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) |#memory_int|) (= 0 (select .cse0 ULTIMATE.start_main_p3)) (= (select .cse1 ULTIMATE.start_main_p6) 0) (= (select .cse2 ULTIMATE.start_main_p7) 0) (= 0 (select .cse3 ULTIMATE.start_main_p5)) (= 0 (select .cse4 ULTIMATE.start_main_p2)) (= 0 (select (store .cse2 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8)) (= 0 (select .cse5 ULTIMATE.start_main_p4))))))))) [2019-01-31 15:20:14,026 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-01-31 15:20:18,148 WARN L181 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-01-31 15:20:18,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:20:18,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-31 15:20:18,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:20:18,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 15:20:18,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-01-31 15:20:30,311 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:20:30,312 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|, ULTIMATE.start_main_p8, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p8))) (and (= (select |v_#memory_int_51| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (= |#memory_int| (store |v_#memory_int_51| ULTIMATE.start_main_p8 (+ .cse0 (- 1)))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p7) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p5) 0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (= .cse0 0) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p2) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p6) 0) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2019-01-31 15:20:30,312 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p6, ULTIMATE.start_main_p8]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-01-31 15:20:33,517 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;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_p3 := 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_p4 := 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_p5 := 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_p6 := 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_p7 := 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_p8 := 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_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {437#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)))} is VALID [2019-01-31 15:20:34,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {441#(and (exists ((ULTIMATE.start_main_p8 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p8) 1))) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-31 15:20:34,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#(and (exists ((ULTIMATE.start_main_p8 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p8) 1))) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-01-31 15:20:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:20:34,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:20:34,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-01-31 15:20:34,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {449#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {445#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:20:34,184 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;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_p3 := 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_p4 := 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_p5 := 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_p6 := 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_p7 := 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_p8 := 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_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {449#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:20:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:20:34,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:20:34,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 15:20:34,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:20:34,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 15:20:34,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:20:34,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 15:20:35,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:20:35,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 15:20:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 15:20:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:20:35,355 INFO L87 Difference]: Start difference. First operand 24 states and 52 transitions. Second operand 6 states. [2019-01-31 15:20:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:20:36,330 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2019-01-31 15:20:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 15:20:36,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 15:20:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:20:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:20:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2019-01-31 15:20:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:20:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2019-01-31 15:20:36,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2019-01-31 15:21:02,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:21:02,737 INFO L225 Difference]: With dead ends: 54 [2019-01-31 15:21:02,737 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 15:21:02,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:21:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 15:21:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-01-31 15:21:02,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:21:02,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 29 states. [2019-01-31 15:21:02,820 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 29 states. [2019-01-31 15:21:02,820 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 29 states. [2019-01-31 15:21:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:21:02,825 INFO L93 Difference]: Finished difference Result 52 states and 85 transitions. [2019-01-31 15:21:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2019-01-31 15:21:02,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:21:02,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:21:02,826 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 52 states. [2019-01-31 15:21:02,826 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 52 states. [2019-01-31 15:21:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:21:02,829 INFO L93 Difference]: Finished difference Result 52 states and 85 transitions. [2019-01-31 15:21:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2019-01-31 15:21:02,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:21:02,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:21:02,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:21:02,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:21:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 15:21:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2019-01-31 15:21:02,832 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 69 transitions. Word has length 3 [2019-01-31 15:21:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:21:02,832 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 69 transitions. [2019-01-31 15:21:02,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 15:21:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 69 transitions. [2019-01-31 15:21:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:21:02,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:21:02,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:21:02,834 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:21:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:21:02,834 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2019-01-31 15:21:02,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:21:02,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:21:02,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:21:02,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:21:02,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:21:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:21:02,977 INFO L273 TraceCheckUtils]: 0: Hoare triple {647#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;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_p3 := 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_p4 := 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_p5 := 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_p6 := 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_p7 := 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_p8 := 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_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {649#(and (= (select |#memory_int| ULTIMATE.start_main_p9) 0) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)))} is VALID [2019-01-31 15:21:02,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {649#(and (= (select |#memory_int| ULTIMATE.start_main_p9) 0) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)))} #memory_int := #memory_int[main_p9 := #memory_int[main_p9] + 1]; {650#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:21:02,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {650#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {648#false} is VALID [2019-01-31 15:21:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:21:02,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:21:02,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:21:02,980 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 15:21:02,980 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2019-01-31 15:21:02,982 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:21:02,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:21:33,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:21:33,346 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:21:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:21:33,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:21:33,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:21:33,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 15:21:33,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:21:33,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:21:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:21:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:21:33,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:21:33,457 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 30 treesize of output 33 [2019-01-31 15:21:33,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-01-31 15:21:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-01-31 15:21:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-01-31 15:21:33,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-01-31 15:21:33,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 15:21:33,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-31 15:21:33,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:33,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-01-31 15:21:33,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 15:21:33,840 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 15:21:33,924 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:33,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:34,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:34,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:34,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:34,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:34,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:34,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:34,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 114 [2019-01-31 15:21:34,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-01-31 15:21:34,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2019-01-31 15:21:34,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:34,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-01-31 15:21:35,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-01-31 15:21:35,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-01-31 15:21:35,508 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 15:21:35,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:35,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 15:21:35,561 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 15:21:35,619 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:35,676 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:35,736 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:35,797 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:35,874 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:35,935 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:21:36,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 15:21:36,067 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 15:21:46,625 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:21:46,626 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, |v_#valid_13|]. (let ((.cse4 (store |v_#valid_13| ULTIMATE.start_main_p1 1))) (let ((.cse3 (store .cse4 ULTIMATE.start_main_p2 1))) (let ((.cse5 (store .cse3 ULTIMATE.start_main_p3 1))) (let ((.cse0 (store .cse5 ULTIMATE.start_main_p4 1))) (let ((.cse1 (store .cse0 ULTIMATE.start_main_p5 1))) (let ((.cse2 (store .cse1 ULTIMATE.start_main_p6 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p5)) (= 0 (select .cse1 ULTIMATE.start_main_p6)) (= (select .cse2 ULTIMATE.start_main_p7) 0) (= (select .cse3 ULTIMATE.start_main_p3) 0) (= (select (store .cse2 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (= 0 (select .cse4 ULTIMATE.start_main_p2)) (= |#memory_int| (store (store (store (store (store (store (store (store (store |v_#memory_int_53| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0)) (= (select .cse5 ULTIMATE.start_main_p4) 0)))))))) [2019-01-31 15:21:46,626 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-01-31 15:21:57,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:21:57,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 16 case distinctions, treesize of input 56 treesize of output 190 [2019-01-31 15:21:57,989 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-31 15:21:58,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 256 xjuncts. [2019-01-31 15:22:02,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 64 dim-0 vars, and 9 xjuncts. [2019-01-31 15:22:02,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:168, output treesize:1271 [2019-01-31 15:22:14,541 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:22:14,542 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_54|, ULTIMATE.start_main_p9, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_54| ULTIMATE.start_main_p9))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p5) 0) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p8) 0) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p7) 0) (= (select |v_#memory_int_54| ULTIMATE.start_main_p4) 0) (= (store |v_#memory_int_54| ULTIMATE.start_main_p9 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (= .cse0 0) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p1) 0) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2019-01-31 15:22:14,542 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_49, v_prenex_54, v_prenex_55, v_prenex_51, v_prenex_52, v_prenex_50, v_prenex_53, v_prenex_56, v_prenex_6, v_prenex_4, v_prenex_5, v_prenex_1, v_prenex_2, v_prenex_7, v_prenex_3, v_prenex_15, v_prenex_20, v_prenex_18, v_prenex_16, v_prenex_17, v_prenex_19, ULTIMATE.start_main_p9, v_prenex_35, v_prenex_39, v_prenex_41, v_prenex_37, v_prenex_36, v_prenex_38, v_prenex_40, v_prenex_28, v_prenex_32, v_prenex_34, v_prenex_33, v_prenex_30, v_prenex_29, v_prenex_31, v_prenex_14, v_prenex_10, v_prenex_13, v_prenex_11, v_prenex_9, v_prenex_12, v_prenex_8, v_prenex_42, v_prenex_46, v_prenex_48, v_prenex_47, v_prenex_44, v_prenex_45, v_prenex_43, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p3, v_prenex_26, v_prenex_23, v_prenex_21, v_prenex_22, v_prenex_25, v_prenex_24, v_prenex_27]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse1 (= .cse0 0))) (or (and (not (= v_prenex_6 v_prenex_4)) (not (= v_prenex_5 v_prenex_1)) (not (= v_prenex_4 v_prenex_2)) (not (= v_prenex_7 v_prenex_4)) (= 0 (select |#memory_int| v_prenex_6)) (not (= v_prenex_7 v_prenex_3)) (= 0 (select |#memory_int| v_prenex_2)) (not (= v_prenex_7 v_prenex_2)) (not (= v_prenex_3 v_prenex_1)) (not (= v_prenex_5 v_prenex_2)) (= 0 (select |#memory_int| v_prenex_4)) (not (= v_prenex_6 v_prenex_5)) (= (select |#memory_int| v_prenex_1) 0) (= 0 (select |#memory_int| v_prenex_3)) (not (= v_prenex_4 v_prenex_3)) (not (= v_prenex_4 v_prenex_1)) (not (= v_prenex_5 v_prenex_3)) (not (= ULTIMATE.start_main_p1 v_prenex_3)) (not (= v_prenex_2 v_prenex_1)) (= (select |#memory_int| v_prenex_7) 0) (not (= v_prenex_7 v_prenex_5)) (not (= v_prenex_7 v_prenex_1)) (= .cse0 1) (not (= ULTIMATE.start_main_p1 v_prenex_2)) (not (= v_prenex_6 v_prenex_2)) (not (= v_prenex_6 v_prenex_3)) (not (= v_prenex_7 v_prenex_6)) (not (= v_prenex_6 v_prenex_1)) (not (= v_prenex_5 v_prenex_4)) (= 0 (select |#memory_int| v_prenex_5)) (not (= v_prenex_3 v_prenex_2))) (and (not (= v_prenex_49 v_prenex_54)) (not (= v_prenex_55 v_prenex_51)) (not (= ULTIMATE.start_main_p1 v_prenex_54)) (not (= v_prenex_54 v_prenex_52)) (not (= v_prenex_50 v_prenex_54)) (= 0 (select |#memory_int| v_prenex_49)) (not (= ULTIMATE.start_main_p1 v_prenex_51)) (not (= v_prenex_50 v_prenex_53)) (not (= ULTIMATE.start_main_p1 v_prenex_55)) (= 0 (select |#memory_int| v_prenex_52)) (not (= v_prenex_50 v_prenex_52)) (not (= v_prenex_53 v_prenex_51)) .cse1 (not (= v_prenex_49 ULTIMATE.start_main_p1)) (not (= v_prenex_55 v_prenex_52)) (= 0 (select |#memory_int| v_prenex_54)) (not (= v_prenex_49 v_prenex_55)) (not (= v_prenex_50 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_51) 0) (= 0 (select |#memory_int| v_prenex_53)) (not (= v_prenex_54 v_prenex_53)) (not (= v_prenex_54 v_prenex_51)) (not (= v_prenex_55 v_prenex_53)) (not (= ULTIMATE.start_main_p1 v_prenex_53)) (not (= v_prenex_52 v_prenex_51)) (= 1 (select |#memory_int| v_prenex_56)) (= (select |#memory_int| v_prenex_50) 0) (not (= v_prenex_50 v_prenex_55)) (not (= v_prenex_50 v_prenex_51)) (not (= ULTIMATE.start_main_p1 v_prenex_52)) (not (= v_prenex_49 v_prenex_52)) (not (= v_prenex_49 v_prenex_53)) (not (= v_prenex_50 v_prenex_49)) (not (= v_prenex_49 v_prenex_51)) (not (= v_prenex_55 v_prenex_54)) (= 0 (select |#memory_int| v_prenex_55)) (not (= v_prenex_53 v_prenex_52))) (and (not (= v_prenex_15 v_prenex_20)) (not (= ULTIMATE.start_main_p1 v_prenex_20)) (not (= v_prenex_20 v_prenex_18)) (not (= v_prenex_16 v_prenex_20)) (= 0 (select |#memory_int| v_prenex_15)) (not (= ULTIMATE.start_main_p1 v_prenex_17)) (not (= v_prenex_16 v_prenex_19)) (= 0 (select |#memory_int| v_prenex_18)) (not (= v_prenex_16 v_prenex_18)) (not (= v_prenex_19 v_prenex_17)) .cse1 (not (= v_prenex_15 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| v_prenex_20)) (not (= ULTIMATE.start_main_p9 v_prenex_19)) (not (= v_prenex_16 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_17) 0) (= 0 (select |#memory_int| v_prenex_19)) (not (= v_prenex_20 v_prenex_19)) (not (= v_prenex_20 v_prenex_17)) (not (= ULTIMATE.start_main_p1 v_prenex_19)) (not (= v_prenex_18 v_prenex_17)) (= 1 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| v_prenex_16) 0) (not (= ULTIMATE.start_main_p9 v_prenex_20)) (not (= v_prenex_16 v_prenex_17)) (not (= ULTIMATE.start_main_p1 v_prenex_18)) (not (= v_prenex_15 v_prenex_18)) (not (= v_prenex_15 v_prenex_19)) (not (= v_prenex_16 v_prenex_15)) (not (= v_prenex_16 ULTIMATE.start_main_p9)) (not (= v_prenex_15 v_prenex_17)) (not (= v_prenex_19 v_prenex_18))) (and (not (= v_prenex_35 v_prenex_39)) (not (= v_prenex_35 v_prenex_41)) (not (= ULTIMATE.start_main_p1 v_prenex_39)) (not (= v_prenex_39 v_prenex_37)) (not (= v_prenex_36 v_prenex_39)) (= 0 (select |#memory_int| v_prenex_35)) (not (= v_prenex_36 v_prenex_38)) (not (= ULTIMATE.start_main_p1 v_prenex_40)) (= 0 (select |#memory_int| v_prenex_37)) (not (= v_prenex_36 v_prenex_37)) .cse1 (not (= v_prenex_35 ULTIMATE.start_main_p1)) (not (= v_prenex_40 v_prenex_37)) (= 0 (select |#memory_int| v_prenex_39)) (not (= v_prenex_35 v_prenex_40)) (not (= v_prenex_36 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| v_prenex_38)) (not (= v_prenex_39 v_prenex_38)) (not (= v_prenex_40 v_prenex_38)) (not (= ULTIMATE.start_main_p1 v_prenex_38)) (not (= v_prenex_41 v_prenex_37)) (= 1 (select |#memory_int| v_prenex_41)) (= (select |#memory_int| v_prenex_36) 0) (not (= v_prenex_41 v_prenex_39)) (not (= v_prenex_36 v_prenex_40)) (not (= ULTIMATE.start_main_p1 v_prenex_37)) (not (= v_prenex_35 v_prenex_37)) (not (= v_prenex_35 v_prenex_38)) (not (= v_prenex_36 v_prenex_35)) (not (= v_prenex_36 v_prenex_41)) (not (= v_prenex_40 v_prenex_39)) (= 0 (select |#memory_int| v_prenex_40)) (not (= v_prenex_38 v_prenex_37))) (and (not (= v_prenex_28 v_prenex_32)) (not (= v_prenex_28 v_prenex_34)) (not (= v_prenex_33 v_prenex_30)) (not (= ULTIMATE.start_main_p1 v_prenex_32)) (not (= v_prenex_29 v_prenex_32)) (= 0 (select |#memory_int| v_prenex_28)) (not (= ULTIMATE.start_main_p1 v_prenex_30)) (not (= v_prenex_29 v_prenex_31)) (not (= ULTIMATE.start_main_p1 v_prenex_33)) (not (= v_prenex_31 v_prenex_30)) .cse1 (not (= v_prenex_28 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| v_prenex_32)) (not (= v_prenex_34 v_prenex_31)) (not (= v_prenex_34 v_prenex_30)) (not (= v_prenex_28 v_prenex_33)) (not (= v_prenex_29 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_30) 0) (= 0 (select |#memory_int| v_prenex_31)) (not (= v_prenex_32 v_prenex_31)) (not (= v_prenex_32 v_prenex_30)) (not (= v_prenex_33 v_prenex_31)) (not (= ULTIMATE.start_main_p1 v_prenex_31)) (= 1 (select |#memory_int| v_prenex_34)) (= (select |#memory_int| v_prenex_29) 0) (not (= v_prenex_29 v_prenex_33)) (not (= v_prenex_29 v_prenex_30)) (not (= v_prenex_28 v_prenex_31)) (not (= v_prenex_29 v_prenex_28)) (not (= v_prenex_28 v_prenex_30)) (not (= v_prenex_33 v_prenex_32)) (= 0 (select |#memory_int| v_prenex_33)) (not (= ULTIMATE.start_main_p1 v_prenex_34))) (and (not (= v_prenex_14 v_prenex_10)) (not (= ULTIMATE.start_main_p1 v_prenex_13)) (not (= v_prenex_13 v_prenex_11)) (not (= v_prenex_9 v_prenex_13)) (not (= ULTIMATE.start_main_p1 v_prenex_10)) (not (= v_prenex_9 v_prenex_12)) (not (= ULTIMATE.start_main_p1 v_prenex_14)) (= 0 (select |#memory_int| v_prenex_11)) (not (= v_prenex_9 v_prenex_11)) (not (= v_prenex_12 v_prenex_10)) .cse1 (not (= v_prenex_14 v_prenex_11)) (= 0 (select |#memory_int| v_prenex_13)) (not (= v_prenex_9 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_10) 0) (= 0 (select |#memory_int| v_prenex_12)) (not (= v_prenex_13 v_prenex_12)) (not (= v_prenex_13 v_prenex_10)) (not (= v_prenex_14 v_prenex_12)) (not (= ULTIMATE.start_main_p1 v_prenex_12)) (not (= v_prenex_11 v_prenex_10)) (= (select |#memory_int| v_prenex_9) 0) (not (= v_prenex_9 v_prenex_14)) (not (= v_prenex_9 v_prenex_10)) (= 1 (select |#memory_int| v_prenex_8)) (not (= ULTIMATE.start_main_p1 v_prenex_11)) (not (= v_prenex_8 v_prenex_11)) (not (= v_prenex_8 v_prenex_12)) (not (= v_prenex_9 v_prenex_8)) (not (= v_prenex_8 v_prenex_10)) (not (= v_prenex_14 v_prenex_13)) (= 0 (select |#memory_int| v_prenex_14)) (not (= v_prenex_12 v_prenex_11))) (and (not (= v_prenex_42 v_prenex_46)) (not (= v_prenex_42 v_prenex_48)) (not (= v_prenex_47 v_prenex_44)) (not (= ULTIMATE.start_main_p1 v_prenex_46)) (not (= v_prenex_46 v_prenex_45)) (not (= v_prenex_43 v_prenex_46)) (= 0 (select |#memory_int| v_prenex_42)) (not (= ULTIMATE.start_main_p1 v_prenex_44)) (not (= ULTIMATE.start_main_p1 v_prenex_47)) (= 0 (select |#memory_int| v_prenex_45)) (not (= v_prenex_43 v_prenex_45)) .cse1 (not (= v_prenex_42 ULTIMATE.start_main_p1)) (not (= v_prenex_47 v_prenex_45)) (= 0 (select |#memory_int| v_prenex_46)) (not (= v_prenex_42 v_prenex_47)) (not (= v_prenex_43 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_44) 0) (not (= v_prenex_46 v_prenex_44)) (not (= v_prenex_45 v_prenex_44)) (not (= v_prenex_48 v_prenex_45)) (= 1 (select |#memory_int| v_prenex_48)) (= (select |#memory_int| v_prenex_43) 0) (not (= v_prenex_48 v_prenex_46)) (not (= v_prenex_43 v_prenex_47)) (not (= v_prenex_43 v_prenex_44)) (not (= ULTIMATE.start_main_p1 v_prenex_45)) (not (= v_prenex_42 v_prenex_45)) (not (= v_prenex_43 v_prenex_42)) (not (= v_prenex_42 v_prenex_44)) (not (= v_prenex_47 v_prenex_46)) (= 0 (select |#memory_int| v_prenex_47)) (not (= v_prenex_48 v_prenex_47)) (not (= ULTIMATE.start_main_p1 v_prenex_48))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) .cse1 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) (and (not (= v_prenex_26 v_prenex_23)) (= 0 (select |#memory_int| v_prenex_21)) (not (= ULTIMATE.start_main_p1 v_prenex_23)) (not (= v_prenex_22 v_prenex_25)) (not (= ULTIMATE.start_main_p1 v_prenex_26)) (= 0 (select |#memory_int| v_prenex_24)) (not (= v_prenex_22 v_prenex_24)) (not (= v_prenex_25 v_prenex_23)) .cse1 (not (= v_prenex_21 ULTIMATE.start_main_p1)) (not (= v_prenex_26 v_prenex_24)) (not (= v_prenex_27 v_prenex_25)) (not (= v_prenex_27 v_prenex_23)) (not (= v_prenex_21 v_prenex_26)) (not (= v_prenex_22 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_23) 0) (= 0 (select |#memory_int| v_prenex_25)) (not (= v_prenex_26 v_prenex_25)) (not (= ULTIMATE.start_main_p1 v_prenex_25)) (not (= v_prenex_24 v_prenex_23)) (= 1 (select |#memory_int| v_prenex_27)) (= (select |#memory_int| v_prenex_22) 0) (not (= v_prenex_22 v_prenex_26)) (not (= v_prenex_22 v_prenex_23)) (not (= ULTIMATE.start_main_p1 v_prenex_24)) (not (= v_prenex_21 v_prenex_24)) (not (= v_prenex_21 v_prenex_25)) (not (= v_prenex_22 v_prenex_21)) (not (= v_prenex_21 v_prenex_23)) (= 0 (select |#memory_int| v_prenex_26)) (not (= v_prenex_27 v_prenex_26)) (not (= v_prenex_25 v_prenex_24))))))