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-a9d37a5-m [2019-02-28 13:57:17,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:57:17,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:57:17,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:57:17,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:57:17,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:57:17,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:57:17,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:57:17,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:57:17,643 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:57:17,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:57:17,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:57:17,647 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:57:17,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:57:17,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:57:17,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:57:17,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:57:17,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:57:17,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:57:17,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:57:17,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:57:17,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:57:17,675 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:57:17,675 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:57:17,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:57:17,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:57:17,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:57:17,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:57:17,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:57:17,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:57:17,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:57:17,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:57:17,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:57:17,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:57:17,689 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:57:17,689 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:57:17,690 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 13:57:17,720 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:57:17,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:57:17,721 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:57:17,721 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:57:17,721 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:57:17,721 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:57:17,725 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:57:17,725 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:57:17,725 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:57:17,725 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:57:17,726 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:57:17,726 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:57:17,726 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:57:17,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:57:17,729 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:57:17,730 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:57:17,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:57:17,730 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:57:17,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:57:17,730 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:57:17,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:57:17,731 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:57:17,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:57:17,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:57:17,731 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:57:17,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:57:17,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:57:17,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:57:17,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:57:17,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:57:17,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:57:17,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:57:17,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:57:17,736 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:57:17,736 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:57:17,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:57:17,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:57:17,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:57:17,737 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:57:17,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:57:17,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:57:17,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:57:17,786 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:57:17,787 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:57:17,788 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-02-28 13:57:17,788 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-02-28 13:57:17,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:57:17,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:57:17,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:57:17,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:57:17,843 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:57:17,861 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,877 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:57:17,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:57:17,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:57:17,922 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:57:17,934 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,934 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,939 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,946 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,957 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,967 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,971 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 28.02 01:57:17" (1/1) ... [2019-02-28 13:57:17,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:57:17,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:57:17,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:57:17,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:57:17,979 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 28.02 01:57:17" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:57:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:57:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:57:19,238 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:57:19,238 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-02-28 13:57:19,239 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:57:19 BoogieIcfgContainer [2019-02-28 13:57:19,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:57:19,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:57:19,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:57:19,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:57:19,244 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 28.02 01:57:17" (1/2) ... [2019-02-28 13:57:19,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12806d88 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:57:19, skipping insertion in model container [2019-02-28 13:57:19,246 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 28.02 01:57:19" (2/2) ... [2019-02-28 13:57:19,248 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-02-28 13:57:19,257 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:57:19,266 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-02-28 13:57:19,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-02-28 13:57:19,309 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:57:19,310 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:57:19,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:57:19,310 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:57:19,310 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:57:19,310 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:57:19,311 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:57:19,311 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:57:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-02-28 13:57:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:57:19,330 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:57:19,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:57:19,334 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:57:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:57:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-02-28 13:57:19,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:57:19,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:57:19,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:57:19,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:57:19,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:57:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:57:19,695 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-02-28 13:57:19,715 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-02-28 13:57:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:57:19,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:57:19,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:57:19,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:57:19,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:57:19,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:57:19,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:57:19,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:57:19,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:57:19,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:57:19,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:57:19,769 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-02-28 13:57:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:57:20,144 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-02-28 13:57:20,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:57:20,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:57:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:57:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:57:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-02-28 13:57:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:57:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-02-28 13:57:20,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2019-02-28 13:57:20,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:57:20,537 INFO L225 Difference]: With dead ends: 41 [2019-02-28 13:57:20,537 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 13:57:20,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:57:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 13:57:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-02-28 13:57:20,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:57:20,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2019-02-28 13:57:20,617 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2019-02-28 13:57:20,617 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2019-02-28 13:57:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:57:20,623 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-02-28 13:57:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-02-28 13:57:20,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:57:20,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:57:20,624 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2019-02-28 13:57:20,625 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2019-02-28 13:57:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:57:20,630 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-02-28 13:57:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-02-28 13:57:20,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:57:20,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:57:20,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:57:20,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:57:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 13:57:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-02-28 13:57:20,640 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-02-28 13:57:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:57:20,641 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-02-28 13:57:20,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:57:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-02-28 13:57:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:57:20,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:57:20,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:57:20,642 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:57:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:57:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-02-28 13:57:20,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:57:20,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:57:20,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:57:20,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:57:20,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:57:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:57:20,843 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-02-28 13:57:20,844 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-02-28 13:57:20,846 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-02-28 13:57:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:57:20,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:57:20,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:57:20,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:57:20,850 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-02-28 13:57:20,898 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:57:20,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:57:27,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:57:27,305 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-02-28 13:57:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:57:27,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:57:27,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:57:27,314 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-02-28 13:57:27,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:57:27,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:57:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:57:27,346 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 13:57:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:57:27,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:57:27,468 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-02-28 13:57:27,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,504 INFO L442 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 35 [2019-02-28 13:57:27,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,525 INFO L442 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 37 [2019-02-28 13:57:27,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,589 INFO L442 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 39 [2019-02-28 13:57:27,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,614 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,617 INFO L442 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 41 [2019-02-28 13:57:27,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,642 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,646 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,651 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,654 INFO L442 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 43 [2019-02-28 13:57:27,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,711 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,718 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,725 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,729 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,730 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,731 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,733 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,735 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,737 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,747 INFO L442 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 45 [2019-02-28 13:57:27,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,794 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,801 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,806 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,832 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,834 INFO L442 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 47 [2019-02-28 13:57:27,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,850 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,860 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,862 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,863 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,869 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,870 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,872 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,919 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:57:27,994 INFO L442 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 8 new quantified variables, introduced 16 case distinctions, treesize of input 47 treesize of output 70 [2019-02-28 13:57:28,006 INFO L315 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,034 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,062 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,087 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,114 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,148 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,169 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,191 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,219 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,510 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-02-28 13:57:28,512 INFO L315 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,520 INFO L315 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,541 INFO L315 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,575 INFO L315 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,612 INFO L315 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,662 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,713 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,782 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:57:28,960 INFO L315 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-02-28 13:57:28,960 INFO L209 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-28 13:58:07,392 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:58:07,392 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-02-28 13:58:07,393 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-02-28 13:58:11,690 WARN L181 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-02-28 13:58:11,917 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-02-28 13:58:11,925 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:58:12,039 INFO L315 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-02-28 13:58:12,040 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:127