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-8-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-27 13:07:49,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 13:07:49,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 13:07:49,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 13:07:49,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 13:07:49,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 13:07:49,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 13:07:49,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 13:07:49,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 13:07:49,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 13:07:49,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 13:07:49,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 13:07:49,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 13:07:49,719 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 13:07:49,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 13:07:49,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 13:07:49,725 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 13:07:49,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 13:07:49,734 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 13:07:49,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 13:07:49,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 13:07:49,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 13:07:49,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 13:07:49,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 13:07:49,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 13:07:49,750 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 13:07:49,751 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 13:07:49,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 13:07:49,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 13:07:49,756 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 13:07:49,756 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 13:07:49,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 13:07:49,760 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 13:07:49,760 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 13:07:49,761 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 13:07:49,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 13:07:49,764 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-27 13:07:49,785 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 13:07:49,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 13:07:49,786 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 13:07:49,786 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 13:07:49,786 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 13:07:49,786 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 13:07:49,786 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 13:07:49,787 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 13:07:49,787 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 13:07:49,787 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 13:07:49,787 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 13:07:49,787 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 13:07:49,788 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 13:07:49,788 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 13:07:49,789 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 13:07:49,789 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 13:07:49,789 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 13:07:49,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 13:07:49,789 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 13:07:49,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 13:07:49,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 13:07:49,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 13:07:49,790 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 13:07:49,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 13:07:49,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 13:07:49,791 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 13:07:49,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 13:07:49,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 13:07:49,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 13:07:49,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 13:07:49,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 13:07:49,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 13:07:49,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 13:07:49,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 13:07:49,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 13:07:49,793 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 13:07:49,793 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 13:07:49,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 13:07:49,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 13:07:49,793 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 13:07:49,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 13:07:49,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 13:07:49,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 13:07:49,847 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 13:07:49,847 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 13:07:49,848 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl [2019-02-27 13:07:49,848 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl' [2019-02-27 13:07:49,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 13:07:49,891 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 13:07:49,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 13:07:49,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 13:07:49,892 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 13:07:49,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 13:07:49,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 13:07:49,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 13:07:49,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 13:07:49,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/1) ... [2019-02-27 13:07:49,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 13:07:50,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 13:07:50,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 13:07:50,000 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 13:07:50,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 13:07:50,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-27 13:07:50,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-27 13:07:51,113 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-27 13:07:51,113 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-02-27 13:07:51,114 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 01:07:51 BoogieIcfgContainer [2019-02-27 13:07:51,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 13:07:51,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 13:07:51,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 13:07:51,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 13:07:51,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:07:49" (1/2) ... [2019-02-27 13:07:51,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1a622 and model type speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 01:07:51, skipping insertion in model container [2019-02-27 13:07:51,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 01:07:51" (2/2) ... [2019-02-27 13:07:51,122 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-limited.bpl [2019-02-27 13:07:51,132 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 13:07:51,140 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-02-27 13:07:51,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-02-27 13:07:51,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 13:07:51,195 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 13:07:51,195 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 13:07:51,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 13:07:51,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 13:07:51,195 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 13:07:51,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 13:07:51,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 13:07:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-02-27 13:07:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-27 13:07:51,232 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:07:51,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-27 13:07:51,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:07:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:07:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-02-27 13:07:51,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:07:51,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:07:51,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:07:51,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:07:51,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:07:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:07:51,493 INFO L273 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;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;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;#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]; {24#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-27 13:07:51,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {23#false} is VALID [2019-02-27 13:07:51,504 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-27 13:07:51,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 13:07:51,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-27 13:07:51,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 13:07:51,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 13:07:51,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:07:51,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 13:07:51,546 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-27 13:07:51,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 13:07:51,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 13:07:51,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 13:07:51,558 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-02-27 13:07:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:07:51,978 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-02-27 13:07:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 13:07:51,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 13:07:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:07:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 13:07:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2019-02-27 13:07:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 13:07:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2019-02-27 13:07:51,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2019-02-27 13:07:52,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 13:07:52,139 INFO L225 Difference]: With dead ends: 37 [2019-02-27 13:07:52,139 INFO L226 Difference]: Without dead ends: 32 [2019-02-27 13:07:52,143 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-27 13:07:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-27 13:07:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-02-27 13:07:52,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:07:52,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 18 states. [2019-02-27 13:07:52,175 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 18 states. [2019-02-27 13:07:52,175 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 18 states. [2019-02-27 13:07:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:07:52,181 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-02-27 13:07:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-02-27 13:07:52,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:07:52,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:07:52,183 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 32 states. [2019-02-27 13:07:52,183 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 32 states. [2019-02-27 13:07:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:07:52,187 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-02-27 13:07:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-02-27 13:07:52,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:07:52,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:07:52,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:07:52,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:07:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-27 13:07:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-02-27 13:07:52,202 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-02-27 13:07:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:07:52,203 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-02-27 13:07:52,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 13:07:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-02-27 13:07:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 13:07:52,204 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:07:52,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 13:07:52,205 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:07:52,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:07:52,206 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-02-27 13:07:52,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:07:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:07:52,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:07:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:07:52,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:07:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:07:52,609 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-27 13:07:52,659 INFO L273 TraceCheckUtils]: 0: Hoare triple {150#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;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;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;#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]; {152#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)))} is VALID [2019-02-27 13:07:52,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {153#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-27 13:07:52,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {151#false} is VALID [2019-02-27 13:07:52,663 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-27 13:07:52,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:07:52,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 13:07:52,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-27 13:07:52,665 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-02-27 13:07:52,702 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 13:07:52,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 13:07:52,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 13:07:52,800 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 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-02-27 13:07:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:07:52,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 13:07:52,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:07:52,806 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-27 13:07:52,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:07:52,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 13:07:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:07:52,839 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-27 13:07:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:07:52,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 13:07:53,106 INFO L467 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 27 treesize of output 30 [2019-02-27 13:07:53,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,127 INFO L467 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 30 treesize of output 36 [2019-02-27 13:07:53,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,194 INFO L467 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 32 treesize of output 46 [2019-02-27 13:07:53,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,272 INFO L467 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 34 treesize of output 60 [2019-02-27 13:07:53,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,370 INFO L467 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 36 treesize of output 78 [2019-02-27 13:07:53,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,448 INFO L467 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 38 treesize of output 100 [2019-02-27 13:07:53,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,553 INFO L467 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 40 treesize of output 126 [2019-02-27 13:07:53,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:53,687 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-02-27 13:07:53,712 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-27 13:07:53,918 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,001 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,051 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,093 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,150 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,183 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,214 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:54,403 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-27 13:07:54,411 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,413 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,415 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,417 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:07:54,466 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-27 13:07:54,466 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:94, output treesize:62 [2019-02-27 13:07:56,517 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:07:56,517 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_10|]. (let ((.cse1 (store |v_#valid_10| ULTIMATE.start_main_p1 1))) (let ((.cse0 (store (store .cse1 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p4)) (= 0 (select (store (store (store .cse0 ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6 1) ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store (store (store (store (store (store (store (store |v_#memory_int_42| 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) |#memory_int|) (= (select .cse1 ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))) [2019-02-27 13:07:56,518 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< 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_p1) 0) (= 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) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-27 13:07:56,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:07:56,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-27 13:07:56,879 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 13:07:57,062 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-27 13:07:57,062 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-02-27 13:07:59,221 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:07:59,221 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, ULTIMATE.start_main_p8, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7]. (let ((.cse0 (select |v_#memory_int_43| ULTIMATE.start_main_p8))) (and (= (select |v_#memory_int_43| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (store |v_#memory_int_43| ULTIMATE.start_main_p8 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |v_#memory_int_43| ULTIMATE.start_main_p3) 0) (= .cse0 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_43| ULTIMATE.start_main_p5) 0) (= (select |v_#memory_int_43| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |v_#memory_int_43| ULTIMATE.start_main_p1) 0) (= (select |v_#memory_int_43| ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select |v_#memory_int_43| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2019-02-27 13:07:59,221 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p8, ULTIMATE.start_main_p7]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-27 13:08:06,169 INFO L273 TraceCheckUtils]: 0: Hoare triple {150#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;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;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;#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]; {157#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< 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) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is UNKNOWN [2019-02-27 13:08:08,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< 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) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {161#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< 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) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p8) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is UNKNOWN [2019-02-27 13:08:08,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {161#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< 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) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p8) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {151#false} is VALID [2019-02-27 13:08:08,549 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-27 13:08:08,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 13:08:08,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {165#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {151#false} is VALID [2019-02-27 13:08:08,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {169#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {165#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-27 13:08:08,578 INFO L273 TraceCheckUtils]: 0: Hoare triple {150#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;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;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;#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]; {169#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-27 13:08:08,578 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-27 13:08:08,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 13:08:08,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-27 13:08:08,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 13:08:08,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-27 13:08:08,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:08:08,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-27 13:08:13,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 4 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2019-02-27 13:08:13,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-27 13:08:13,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-27 13:08:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-02-27 13:08:13,112 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 6 states. [2019-02-27 13:08:19,896 WARN L181 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-02-27 13:08:28,048 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-27 13:08:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 13:08:28,049 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:2024 -smt2 -in -t:2000)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.predicates.PredicateUtils.isInductiveHelper(PredicateUtils.java:346) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:208) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:163) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.reviewInductiveInternal(EfficientHoareTripleChecker.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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) ... 43 more [2019-02-27 13:08:28,054 INFO L168 Benchmark]: Toolchain (without parser) took 38163.81 ms. Allocated memory was 139.5 MB in the beginning and 257.9 MB in the end (delta: 118.5 MB). Free memory was 104.4 MB in the beginning and 119.1 MB in the end (delta: -14.7 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2019-02-27 13:08:28,056 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 13:08:28,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.27 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 101.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-02-27 13:08:28,057 INFO L168 Benchmark]: Boogie Preprocessor took 29.95 ms. Allocated memory is still 139.5 MB. Free memory was 101.5 MB in the beginning and 100.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-02-27 13:08:28,058 INFO L168 Benchmark]: RCFGBuilder took 1114.99 ms. Allocated memory is still 139.5 MB. Free memory was 100.1 MB in the beginning and 69.3 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-02-27 13:08:28,059 INFO L168 Benchmark]: TraceAbstraction took 36937.06 ms. Allocated memory was 139.5 MB in the beginning and 257.9 MB in the end (delta: 118.5 MB). Free memory was 68.9 MB in the beginning and 119.1 MB in the end (delta: -50.2 MB). Peak memory consumption was 68.3 MB. Max. memory is 7.1 GB. [2019-02-27 13:08:28,063 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 139.5 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.27 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 101.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.95 ms. Allocated memory is still 139.5 MB. Free memory was 101.5 MB in the beginning and 100.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1114.99 ms. Allocated memory is still 139.5 MB. Free memory was 100.1 MB in the beginning and 69.3 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36937.06 ms. Allocated memory was 139.5 MB in the beginning and 257.9 MB in the end (delta: 118.5 MB). Free memory was 68.9 MB in the beginning and 119.1 MB in the end (delta: -50.2 MB). Peak memory consumption was 68.3 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:2024 -smt2 -in -t:2000)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:2024 -smt2 -in -t:2000)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...