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-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:37:55,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:37:55,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:37:55,870 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:37:55,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:37:55,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:37:55,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:37:55,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:37:55,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:37:55,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:37:55,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:37:55,878 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:37:55,879 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:37:55,880 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:37:55,881 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:37:55,881 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:37:55,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:37:55,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:37:55,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:37:55,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:37:55,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:37:55,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:37:55,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:37:55,892 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:37:55,892 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:37:55,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:37:55,894 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:37:55,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:37:55,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:37:55,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:37:55,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:37:55,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:37:55,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:37:55,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:37:55,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:37:55,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:37:55,900 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-01-31 14:37:55,912 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:37:55,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:37:55,913 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:37:55,913 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:37:55,914 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:37:55,914 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:37:55,914 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:37:55,914 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:37:55,914 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:37:55,915 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:37:55,915 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:37:55,915 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:37:55,915 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:37:55,915 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:37:55,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:37:55,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:37:55,916 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:37:55,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:37:55,917 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:37:55,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:37:55,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:37:55,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:37:55,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:37:55,919 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:37:55,919 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:37:55,919 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:37:55,919 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:37:55,919 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:37:55,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:37:55,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:37:55,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:37:55,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:37:55,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:37:55,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:37:55,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:37:55,921 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:37:55,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:37:55,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:37:55,922 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:37:55,922 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:37:55,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:37:55,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:37:55,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:37:55,974 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:37:55,974 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:37:55,975 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl [2019-01-31 14:37:55,975 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl' [2019-01-31 14:37:56,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:37:56,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:37:56,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:37:56,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:37:56,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:37:56,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:37:56,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:37:56,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:37:56,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:37:56,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/1) ... [2019-01-31 14:37:56,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:37:56,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:37:56,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:37:56,152 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:37:56,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37: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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:37:56,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:37:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:37:57,303 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:37:57,304 INFO L286 CfgBuilder]: Removed 23 assue(true) statements. [2019-01-31 14:37:57,305 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:37:57 BoogieIcfgContainer [2019-01-31 14:37:57,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:37:57,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:37:57,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:37:57,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:37:57,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:37:56" (1/2) ... [2019-01-31 14:37:57,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b08b69d and model type speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:37:57, skipping insertion in model container [2019-01-31 14:37:57,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:37:57" (2/2) ... [2019-01-31 14:37:57,313 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-10-limited.bpl [2019-01-31 14:37:57,331 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:37:57,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-31 14:37:57,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-31 14:37:57,388 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:37:57,388 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:37:57,388 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:37:57,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:37:57,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:37:57,389 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:37:57,389 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:37:57,389 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:37:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-01-31 14:37:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 14:37:57,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:37:57,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 14:37:57,415 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:37:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:37:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1004, now seen corresponding path program 1 times [2019-01-31 14:37:57,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:37:57,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:37:57,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:37:57,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:37:57,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:37:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:37:57,731 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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#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-01-31 14:37:57,749 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-01-31 14:37:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:37:57,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:37:57,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 14:37:57,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:37:57,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:37:57,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:37:57,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:37:57,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:37:57,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:37:57,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:37:57,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:37:57,796 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-01-31 14:37:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:37:58,407 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2019-01-31 14:37:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:37:58,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:37:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:37:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:37:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2019-01-31 14:37:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:37:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2019-01-31 14:37:58,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2019-01-31 14:37:58,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:37:58,589 INFO L225 Difference]: With dead ends: 45 [2019-01-31 14:37:58,589 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 14:37:58,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:37:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 14:37:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-01-31 14:37:58,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:37:58,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 22 states. [2019-01-31 14:37:58,651 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 22 states. [2019-01-31 14:37:58,652 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 22 states. [2019-01-31 14:37:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:37:58,658 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-01-31 14:37:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-01-31 14:37:58,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:37:58,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:37:58,659 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 40 states. [2019-01-31 14:37:58,659 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 40 states. [2019-01-31 14:37:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:37:58,664 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-01-31 14:37:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-01-31 14:37:58,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:37:58,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:37:58,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:37:58,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:37:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 14:37:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2019-01-31 14:37:58,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 2 [2019-01-31 14:37:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:37:58,670 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2019-01-31 14:37:58,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:37:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2019-01-31 14:37:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:37:58,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:37:58,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:37:58,673 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:37:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:37:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash 30392, now seen corresponding path program 1 times [2019-01-31 14:37:58,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:37:58,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:37:58,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:37:58,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:37:58,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:37:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:37:58,917 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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#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-01-31 14:37:58,924 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-01-31 14:37:58,943 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-01-31 14:37:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:37:58,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:37:58,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:37:58,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 14:37:58,947 INFO L207 CegarAbsIntRunner]: [0], [18], [43] [2019-01-31 14:37:58,989 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:37:58,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:37:59,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:37:59,134 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 122 root evaluator evaluations with a maximum evaluation depth of 3. Performed 122 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 14:37:59,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:37:59,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:37:59,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:37:59,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 14:37:59,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:37:59,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:37:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:37:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:37:59,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:37:59,717 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-31 14:37:59,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2019-01-31 14:37:59,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2019-01-31 14:37:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 52 [2019-01-31 14:37:59,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 66 [2019-01-31 14:37:59,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:37:59,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 84 [2019-01-31 14:38:00,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 106 [2019-01-31 14:38:00,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 132 [2019-01-31 14:38:00,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 162 [2019-01-31 14:38:00,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,481 INFO L478 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 196 [2019-01-31 14:38:00,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:00,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 231 [2019-01-31 14:38:00,748 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,032 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,141 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,222 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,287 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,363 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,460 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:01,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:01,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:01,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 95 [2019-01-31 14:38:01,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2019-01-31 14:38:01,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,071 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-01-31 14:38:02,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 98 [2019-01-31 14:38:02,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2019-01-31 14:38:02,242 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-31 14:38:02,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 121 [2019-01-31 14:38:02,501 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-31 14:38:02,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 137 [2019-01-31 14:38:02,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 134 [2019-01-31 14:38:02,838 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-31 14:38:02,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:02,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 14:38:02,898 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-31 14:38:02,902 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:02,906 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:02,909 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:02,913 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:02,916 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:02,919 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:02,922 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:38:02,990 INFO L267 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-01-31 14:38:02,991 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:155, output treesize:78 [2019-01-31 14:38:17,423 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:38:17,423 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p9, ULTIMATE.start_main_p10, |v_#valid_12|]. (let ((.cse1 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store (store .cse1 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1))) (let ((.cse0 (store (store .cse2 ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1))) (let ((.cse3 (store .cse0 ULTIMATE.start_main_p6 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select .cse0 ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= (store (store (store (store (store (store (store (store (store (store |v_#memory_int_52| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) ULTIMATE.start_main_p10 0) |#memory_int|) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select .cse2 ULTIMATE.start_main_p4)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select .cse3 ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select (store (store .cse3 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8 1) ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))))) [2019-01-31 14:38:17,424 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p10, ULTIMATE.start_main_p9, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-31 14:38:28,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:38:28,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 231 [2019-01-31 14:38:28,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:38:28,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-01-31 14:38:28,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:88, output treesize:78 [2019-01-31 14:38:39,342 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:38:39,343 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p9, ULTIMATE.start_main_p3, ULTIMATE.start_main_p7, ULTIMATE.start_main_p10, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_53| ULTIMATE.start_main_p4))) (and (= (select |v_#memory_int_53| ULTIMATE.start_main_p9) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_53| ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= (select |v_#memory_int_53| ULTIMATE.start_main_p8) 0) (= .cse0 0) (= (select |v_#memory_int_53| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_53| ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store |v_#memory_int_53| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= (select |v_#memory_int_53| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select |v_#memory_int_53| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |v_#memory_int_53| ULTIMATE.start_main_p10)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p1) 0))) [2019-01-31 14:38:39,343 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p10, ULTIMATE.start_main_p9, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-31 14:39:09,211 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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#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]; {189#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2019-01-31 14:39:23,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is UNKNOWN [2019-01-31 14:39:23,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2019-01-31 14:39:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:39:23,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:39:23,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2019-01-31 14:39:23,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {197#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:39:23,592 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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#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]; {201#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:39:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:39:23,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:39:23,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 14:39:23,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:39:23,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 14:39:23,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:39:23,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 14:39:38,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-01-31 14:39:38,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 14:39:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 14:39:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-31 14:39:38,233 INFO L87 Difference]: Start difference. First operand 22 states and 41 transitions. Second operand 6 states. [2019-01-31 14:39:56,752 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000) stderr output: (error "out of memory") [2019-01-31 14:39:56,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:39:56,754 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.checkEquivalence(SimplifyDDAWithTimeout.java:132) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 44 more [2019-01-31 14:39:56,759 INFO L168 Benchmark]: Toolchain (without parser) took 120733.09 ms. Allocated memory was 141.0 MB in the beginning and 300.9 MB in the end (delta: 159.9 MB). Free memory was 108.1 MB in the beginning and 140.0 MB in the end (delta: -31.9 MB). Peak memory consumption was 128.0 MB. Max. memory is 7.1 GB. [2019-01-31 14:39:56,760 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:39:56,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.85 ms. Allocated memory is still 141.0 MB. Free memory was 108.1 MB in the beginning and 105.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-01-31 14:39:56,763 INFO L168 Benchmark]: Boogie Preprocessor took 42.25 ms. Allocated memory is still 141.0 MB. Free memory was 105.4 MB in the beginning and 104.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 14:39:56,765 INFO L168 Benchmark]: RCFGBuilder took 1153.91 ms. Allocated memory is still 141.0 MB. Free memory was 103.9 MB in the beginning and 63.3 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:39:56,766 INFO L168 Benchmark]: TraceAbstraction took 119451.51 ms. Allocated memory was 141.0 MB in the beginning and 300.9 MB in the end (delta: 159.9 MB). Free memory was 63.0 MB in the beginning and 140.0 MB in the end (delta: -77.0 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2019-01-31 14:39:56,773 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.85 ms. Allocated memory is still 141.0 MB. Free memory was 108.1 MB in the beginning and 105.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.25 ms. Allocated memory is still 141.0 MB. Free memory was 105.4 MB in the beginning and 104.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1153.91 ms. Allocated memory is still 141.0 MB. Free memory was 103.9 MB in the beginning and 63.3 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119451.51 ms. Allocated memory was 141.0 MB in the beginning and 300.9 MB in the end (delta: 159.9 MB). Free memory was 63.0 MB in the beginning and 140.0 MB in the end (delta: -77.0 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...