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-10-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:09:55,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:09:55,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:09:55,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:09:55,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:09:55,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:09:55,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:09:55,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:09:55,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:09:55,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:09:55,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:09:55,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:09:55,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:09:55,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:09:55,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:09:55,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:09:55,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:09:55,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:09:55,920 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:09:55,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:09:55,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:09:55,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:09:55,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:09:55,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:09:55,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:09:55,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:09:55,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:09:55,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:09:55,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:09:55,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:09:55,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:09:55,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:09:55,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:09:55,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:09:55,934 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:09:55,936 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:09:55,936 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:09:55,961 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:09:55,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:09:55,962 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:09:55,962 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:09:55,963 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:09:55,963 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:09:55,963 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:09:55,963 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:09:55,963 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:09:55,964 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:09:55,964 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:09:55,964 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:09:55,964 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:09:55,964 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:09:55,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:09:55,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:09:55,965 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:09:55,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:09:55,966 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:09:55,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:09:55,966 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:09:55,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:09:55,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:09:55,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:09:55,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:09:55,967 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:09:55,967 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:09:55,967 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:09:55,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:09:55,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:09:55,968 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:09:55,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:09:55,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:09:55,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:09:55,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:09:55,969 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:09:55,969 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:09:55,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:09:55,970 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:09:55,970 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:09:56,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:09:56,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:09:56,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:09:56,019 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:09:56,020 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:09:56,021 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-unlimited.bpl [2019-02-28 13:09:56,021 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-unlimited.bpl' [2019-02-28 13:09:56,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:09:56,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:09:56,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:09:56,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:09:56,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:09:56,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:09:56,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:09:56,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:09:56,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:09:56,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/1) ... [2019-02-28 13:09:56,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:09:56,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:09:56,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:09:56,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:09:56,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (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:09:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:09:56,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:09:57,605 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:09:57,605 INFO L286 CfgBuilder]: Removed 23 assue(true) statements. [2019-02-28 13:09:57,607 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:09:57 BoogieIcfgContainer [2019-02-28 13:09:57,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:09:57,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:09:57,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:09:57,611 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:09:57,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:09:56" (1/2) ... [2019-02-28 13:09:57,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e724783 and model type speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:09:57, skipping insertion in model container [2019-02-28 13:09:57,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:09:57" (2/2) ... [2019-02-28 13:09:57,615 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-10-unlimited.bpl [2019-02-28 13:09:57,625 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:09:57,634 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-02-28 13:09:57,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-02-28 13:09:57,695 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:09:57,695 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:09:57,695 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:09:57,695 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:09:57,695 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:09:57,696 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:09:57,696 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:09:57,696 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:09:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-02-28 13:09:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:09:57,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:09:57,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:09:57,738 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:09:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:09:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1004, now seen corresponding path program 1 times [2019-02-28 13:09:57,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:09:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:09:57,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:09:57,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:09:57,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:09:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:09:58,034 INFO L273 TraceCheckUtils]: 0: Hoare triple {26#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;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;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_p10 := 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];#memory_int := #memory_int[main_p10 := 0]; {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:09:58,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {27#false} is VALID [2019-02-28 13:09:58,055 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:09:58,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:09:58,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:09:58,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:09:58,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:09:58,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:09:58,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:09:58,107 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:09:58,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:09:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:09:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:09:58,125 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-02-28 13:09:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:09:58,682 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2019-02-28 13:09:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:09:58,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:09:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:09:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:09:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2019-02-28 13:09:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:09:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2019-02-28 13:09:58,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2019-02-28 13:09:59,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:09:59,059 INFO L225 Difference]: With dead ends: 45 [2019-02-28 13:09:59,059 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 13:09:59,065 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:09:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 13:09:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-02-28 13:09:59,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:09:59,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 22 states. [2019-02-28 13:09:59,139 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 22 states. [2019-02-28 13:09:59,139 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 22 states. [2019-02-28 13:09:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:09:59,149 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-02-28 13:09:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-02-28 13:09:59,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:09:59,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:09:59,152 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 40 states. [2019-02-28 13:09:59,152 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 40 states. [2019-02-28 13:09:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:09:59,164 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-02-28 13:09:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-02-28 13:09:59,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:09:59,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:09:59,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:09:59,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:09:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 13:09:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2019-02-28 13:09:59,173 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 2 [2019-02-28 13:09:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:09:59,173 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2019-02-28 13:09:59,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:09:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2019-02-28 13:09:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:09:59,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:09:59,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:09:59,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:09:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:09:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash 30392, now seen corresponding path program 1 times [2019-02-28 13:09:59,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:09:59,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:09:59,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:09:59,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:09:59,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:09:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:09:59,423 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;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;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_p10 := 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];#memory_int := #memory_int[main_p10 := 0]; {184#(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:09:59,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#(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]; {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:09:59,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2019-02-28 13:09:59,425 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:09:59,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:09:59,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:09:59,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:09:59,428 INFO L207 CegarAbsIntRunner]: [0], [18], [43] [2019-02-28 13:09:59,464 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:09:59,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:09:59,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:09:59,579 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 104 root evaluator evaluations with a maximum evaluation depth of 2. Performed 104 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:09:59,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:09:59,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:09:59,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:09:59,586 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:09:59,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:09:59,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:09:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:09:59,608 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 13:09:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:09:59,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:09:59,818 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 33 treesize of output 36 [2019-02-28 13:09:59,831 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:09:59,834 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 36 treesize of output 38 [2019-02-28 13:09:59,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:09:59,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:09:59,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:09:59,961 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 38 treesize of output 40 [2019-02-28 13:10:00,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,117 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,159 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,160 INFO L289 Elim1Store]: Index analysis took 142 ms [2019-02-28 13:10:00,161 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 40 treesize of output 42 [2019-02-28 13:10:00,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,267 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,276 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,278 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,280 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,284 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,292 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,293 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,299 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 42 treesize of output 44 [2019-02-28 13:10:00,383 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,401 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,402 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,403 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,409 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,411 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,419 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,438 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,440 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,462 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,477 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,477 INFO L289 Elim1Store]: Index analysis took 111 ms [2019-02-28 13:10:00,482 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 44 treesize of output 46 [2019-02-28 13:10:00,508 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,509 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,537 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,543 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,550 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,552 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,557 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,561 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,563 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,565 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 46 treesize of output 48 [2019-02-28 13:10:00,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,606 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,643 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,647 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,650 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,655 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,656 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,679 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 48 treesize of output 50 [2019-02-28 13:10:00,715 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,729 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,730 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,731 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,732 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,733 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,734 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,749 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,750 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,762 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,769 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,796 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,827 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,828 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,837 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,839 INFO L289 Elim1Store]: Index analysis took 129 ms [2019-02-28 13:10:00,844 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2019-02-28 13:10:00,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,903 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,905 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,977 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,982 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:10:00,986 INFO L289 Elim1Store]: Index analysis took 110 ms [2019-02-28 13:10:01,122 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 52 treesize of output 78 [2019-02-28 13:10:01,136 INFO L315 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,166 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,194 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,221 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,251 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,283 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,311 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,340 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,379 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,416 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,827 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-02-28 13:10:01,872 INFO L315 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-02-28 13:10:01,898 INFO L315 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:02,055 INFO L315 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:02,092 INFO L315 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:02,185 INFO L315 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:02,234 INFO L315 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:02,293 INFO L315 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:02,388 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:02,497 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:10:02,757 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-02-28 13:10:02,758 INFO L209 ElimStorePlain]: Needed 20 recursive calls to eliminate 10 variables, input treesize:182, output treesize:195