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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:21:46,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:21:46,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:21:46,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:21:46,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:21:46,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:21:46,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:21:46,960 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:21:46,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:21:46,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:21:46,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:21:46,964 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:21:46,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:21:46,966 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:21:46,967 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:21:46,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:21:46,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:21:46,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:21:46,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:21:46,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:21:46,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:21:46,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:21:46,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:21:46,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:21:46,980 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:21:46,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:21:46,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:21:46,983 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:21:46,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:21:46,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:21:46,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:21:46,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:21:46,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:21:46,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:21:46,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:21:46,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:21:46,994 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 13:21:47,019 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:21:47,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:21:47,020 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:21:47,020 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:21:47,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:21:47,021 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:21:47,021 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:21:47,021 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:21:47,021 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:21:47,022 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:21:47,022 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:21:47,022 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:21:47,022 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:21:47,022 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:21:47,023 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:21:47,023 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:21:47,024 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:21:47,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:21:47,026 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:21:47,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:21:47,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:21:47,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:21:47,027 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:21:47,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:21:47,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:21:47,028 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:21:47,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:21:47,028 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:21:47,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:21:47,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:21:47,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:21:47,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:21:47,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:21:47,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:21:47,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:21:47,030 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:21:47,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:21:47,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:21:47,031 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:21:47,031 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:21:47,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:21:47,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:21:47,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:21:47,098 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:21:47,098 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:21:47,099 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:21:47,099 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:21:47,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:21:47,164 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:21:47,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:21:47,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:21:47,165 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:21:47,181 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:21:47" (1/1) ... [2019-02-28 13:21:47,193 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:21:47" (1/1) ... [2019-02-28 13:21:47,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:21:47,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:21:47,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:21:47,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:21:47,248 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:21:47" (1/1) ... [2019-02-28 13:21:47,248 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:21:47" (1/1) ... [2019-02-28 13:21:47,251 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:21:47" (1/1) ... [2019-02-28 13:21:47,252 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:21:47" (1/1) ... [2019-02-28 13:21:47,267 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:21:47" (1/1) ... [2019-02-28 13:21:47,271 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:21:47" (1/1) ... [2019-02-28 13:21:47,276 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:21:47" (1/1) ... [2019-02-28 13:21:47,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:21:47,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:21:47,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:21:47,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:21:47,283 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:21:47" (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:21:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:21:47,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:21:48,476 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:21:48,477 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-02-28 13:21:48,478 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:21:48 BoogieIcfgContainer [2019-02-28 13:21:48,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:21:48,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:21:48,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:21:48,483 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:21:48,483 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:21:47" (1/2) ... [2019-02-28 13:21:48,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba4ccd0 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:21:48, skipping insertion in model container [2019-02-28 13:21:48,485 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:21:48" (2/2) ... [2019-02-28 13:21:48,487 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-02-28 13:21:48,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:21:48,504 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-02-28 13:21:48,521 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-02-28 13:21:48,553 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:21:48,553 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:21:48,553 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:21:48,554 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:21:48,554 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:21:48,554 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:21:48,554 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:21:48,554 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:21:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-02-28 13:21:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:21:48,576 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:21:48,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:21:48,580 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:21:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:21:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-02-28 13:21:48,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:21:48,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:21:48,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:21:48,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:21:48,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:21:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:21:48,905 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:21:48,909 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:21:48,911 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:21:48,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:21:48,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:21:48,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:21:48,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:21:48,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:21:48,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:21:48,941 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:21:48,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:21:48,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:21:48,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:21:48,950 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-02-28 13:21:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:21:49,436 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-02-28 13:21:49,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:21:49,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:21:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:21:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:21:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-02-28 13:21:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:21:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-02-28 13:21:49,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2019-02-28 13:21:49,598 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:21:49,611 INFO L225 Difference]: With dead ends: 41 [2019-02-28 13:21:49,612 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 13:21:49,615 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:21:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 13:21:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-02-28 13:21:49,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:21:49,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2019-02-28 13:21:49,654 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2019-02-28 13:21:49,654 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2019-02-28 13:21:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:21:49,660 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-02-28 13:21:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-02-28 13:21:49,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:21:49,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:21:49,661 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2019-02-28 13:21:49,661 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2019-02-28 13:21:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:21:49,665 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-02-28 13:21:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-02-28 13:21:49,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:21:49,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:21:49,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:21:49,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:21:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 13:21:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-02-28 13:21:49,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-02-28 13:21:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:21:49,672 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-02-28 13:21:49,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:21:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-02-28 13:21:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:21:49,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:21:49,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:21:49,673 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:21:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:21:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-02-28 13:21:49,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:21:49,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:21:49,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:21:49,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:21:49,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:21:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:21:49,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:21:49,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:21:49,849 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:21:49,849 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:21:49,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:21:49,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:21:49,850 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:21:49,853 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-02-28 13:21:49,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:21:49,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:21:50,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:21:50,018 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:21:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:21:50,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:21:50,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:21:50,024 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:21:50,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:21:50,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:21:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:21:50,088 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 13:21:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:21:50,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:21:50,418 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:21:50,442 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,444 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:21:50,470 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,519 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:21:50,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,624 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,699 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,729 INFO L289 Elim1Store]: Index analysis took 155 ms [2019-02-28 13:21:50,730 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:21:50,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,829 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,913 INFO L289 Elim1Store]: Index analysis took 130 ms [2019-02-28 13:21:50,915 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:21:50,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:50,970 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:21:51,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,020 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,051 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:21:51,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,103 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,113 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,117 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,119 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,120 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,122 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,137 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,156 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,159 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:21:51,191 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,192 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,198 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,205 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,207 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,208 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,217 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,250 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,270 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,274 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,276 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,278 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,281 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,306 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:21:51,308 INFO L289 Elim1Store]: Index analysis took 122 ms [2019-02-28 13:21:51,448 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:21:51,493 INFO L315 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-28 13:21:51,567 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:51,612 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:51,639 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:51,661 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:51,687 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:51,715 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:51,748 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:51,776 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,082 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:21:52,088 INFO L315 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,096 INFO L315 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,120 INFO L315 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,196 INFO L315 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,254 INFO L315 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,354 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,408 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,531 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:21:52,668 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:21:52,669 INFO L209 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158