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-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:12:42,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:12:42,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:12:42,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:12:42,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:12:42,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:12:42,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:12:42,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:12:42,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:12:42,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:12:42,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:12:42,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:12:42,102 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:12:42,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:12:42,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:12:42,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:12:42,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:12:42,108 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:12:42,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:12:42,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:12:42,113 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:12:42,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:12:42,117 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:12:42,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:12:42,117 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:12:42,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:12:42,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:12:42,120 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:12:42,121 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:12:42,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:12:42,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:12:42,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:12:42,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:12:42,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:12:42,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:12:42,126 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:12:42,126 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 [2018-12-18 22:12:42,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:12:42,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:12:42,142 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:12:42,142 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:12:42,142 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:12:42,142 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:12:42,142 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:12:42,143 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:12:42,143 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 22:12:42,143 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:12:42,143 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 22:12:42,143 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 22:12:42,144 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:12:42,144 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:12:42,145 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:12:42,145 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:12:42,145 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:12:42,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:12:42,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:12:42,146 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:12:42,146 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:12:42,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:12:42,146 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:12:42,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:12:42,147 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:12:42,147 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:12:42,147 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:12:42,147 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:12:42,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:12:42,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:12:42,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:12:42,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:12:42,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:12:42,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:12:42,148 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:12:42,149 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:12:42,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:12:42,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:12:42,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:12:42,149 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:12:42,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:12:42,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:12:42,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:12:42,225 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:12:42,225 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:12:42,226 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2018-12-18 22:12:42,226 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2018-12-18 22:12:42,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:12:42,295 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:12:42,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:12:42,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:12:42,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:12:42,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:12:42,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:12:42,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:12:42,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:12:42,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/1) ... [2018-12-18 22:12:42,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:12:42,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:12:42,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:12:42,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:12:42,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (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 [2018-12-18 22:12:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:12:42,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:12:43,448 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:12:43,449 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-18 22:12:43,449 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:12:43 BoogieIcfgContainer [2018-12-18 22:12:43,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:12:43,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:12:43,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:12:43,457 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:12:43,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:12:42" (1/2) ... [2018-12-18 22:12:43,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e6156b and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:12:43, skipping insertion in model container [2018-12-18 22:12:43,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:12:43" (2/2) ... [2018-12-18 22:12:43,461 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2018-12-18 22:12:43,470 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:12:43,477 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-18 22:12:43,491 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-18 22:12:43,524 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:12:43,525 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:12:43,525 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:12:43,525 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:12:43,525 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:12:43,525 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:12:43,526 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:12:43,526 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:12:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-18 22:12:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:12:43,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:43,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:12:43,551 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2018-12-18 22:12:43,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:43,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:43,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:43,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:43,853 INFO L273 TraceCheckUtils]: 0: Hoare triple {20#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;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;#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]; {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:43,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {21#false} is VALID [2018-12-18 22:12:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:43,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:12:43,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:12:43,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:43,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:12:43,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:43,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:12:43,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:43,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:12:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:12:43,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:43,959 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-18 22:12:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:44,305 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2018-12-18 22:12:44,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:44,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:12:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-12-18 22:12:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-12-18 22:12:44,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-12-18 22:12:44,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:44,484 INFO L225 Difference]: With dead ends: 33 [2018-12-18 22:12:44,484 INFO L226 Difference]: Without dead ends: 28 [2018-12-18 22:12:44,487 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 [2018-12-18 22:12:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-18 22:12:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-18 22:12:44,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:44,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 16 states. [2018-12-18 22:12:44,563 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 16 states. [2018-12-18 22:12:44,564 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 16 states. [2018-12-18 22:12:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:44,569 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 22:12:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-12-18 22:12:44,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:44,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:44,570 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 28 states. [2018-12-18 22:12:44,570 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 28 states. [2018-12-18 22:12:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:44,574 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 22:12:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-12-18 22:12:44,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:44,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:44,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:44,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-18 22:12:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-18 22:12:44,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2018-12-18 22:12:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:44,581 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-18 22:12:44,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:12:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-18 22:12:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:44,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:44,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:44,583 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:44,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:44,584 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2018-12-18 22:12:44,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:44,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:44,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:44,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:44,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:44,678 INFO L273 TraceCheckUtils]: 0: Hoare triple {134#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;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;#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]; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 22:12:44,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] <= 0; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-18 22:12:44,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] >= 0); {135#false} is VALID [2018-12-18 22:12:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:44,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:12:44,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:12:44,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:44,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:12:44,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:44,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:12:44,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:44,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:12:44,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:12:44,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:44,729 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2018-12-18 22:12:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:45,240 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2018-12-18 22:12:45,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:45,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-18 22:12:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-18 22:12:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-12-18 22:12:45,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-12-18 22:12:45,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:45,334 INFO L225 Difference]: With dead ends: 28 [2018-12-18 22:12:45,334 INFO L226 Difference]: Without dead ends: 27 [2018-12-18 22:12:45,337 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 [2018-12-18 22:12:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-18 22:12:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-18 22:12:45,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:45,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 17 states. [2018-12-18 22:12:45,348 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 17 states. [2018-12-18 22:12:45,348 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 17 states. [2018-12-18 22:12:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:45,352 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-18 22:12:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-12-18 22:12:45,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:45,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:45,353 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states. [2018-12-18 22:12:45,353 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states. [2018-12-18 22:12:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:45,356 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-12-18 22:12:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2018-12-18 22:12:45,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:45,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:45,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:45,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-18 22:12:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-12-18 22:12:45,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2018-12-18 22:12:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:45,360 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2018-12-18 22:12:45,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:12:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2018-12-18 22:12:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:45,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:45,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:45,362 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2018-12-18 22:12:45,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:45,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:45,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:45,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:45,593 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-12-18 22:12:45,652 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;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;#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]; {244#(or (and (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p4) 0)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2018-12-18 22:12:45,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#(or (and (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p4) 0)) (= 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]; {245#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:12:45,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {245#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} assume !(#memory_int[main_p1] <= 0); {243#false} is VALID [2018-12-18 22:12:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:45,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:12:45,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:12:45,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:12:45,666 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2018-12-18 22:12:45,703 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:12:45,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:12:45,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:12:45,836 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:12:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:45,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:12:45,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:12:45,843 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 [2018-12-18 22:12:45,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:45,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:12:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:45,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:12:46,296 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-18 22:12:46,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,377 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 68 treesize of output 71 [2018-12-18 22:12:46,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2018-12-18 22:12:46,679 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-12-18 22:12:46,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,736 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 46 treesize of output 72 [2018-12-18 22:12:46,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:46,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2018-12-18 22:12:47,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:47,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:47,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:47,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:47,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:47,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:47,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:47,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:47,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2018-12-18 22:12:47,131 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,188 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-12-18 22:12:47,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-12-18 22:12:47,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-12-18 22:12:47,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-12-18 22:12:47,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-12-18 22:12:47,687 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 35 treesize of output 97 [2018-12-18 22:12:47,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2018-12-18 22:12:47,756 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,797 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,835 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,862 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,884 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,901 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,918 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:47,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-18 22:12:47,997 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2018-12-18 22:12:48,114 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:12:48,114 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_9|]. (let ((.cse0 (store |v_#valid_9| ULTIMATE.start_main_p1 1))) (let ((.cse1 (store .cse0 ULTIMATE.start_main_p2 1))) (let ((.cse3 (store .cse1 ULTIMATE.start_main_p3 1))) (let ((.cse2 (store .cse3 ULTIMATE.start_main_p4 1))) (and (= (select .cse0 ULTIMATE.start_main_p2) 0) (= (select .cse1 ULTIMATE.start_main_p3) 0) (= (select (store .cse2 ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6) 0) (= 0 (select .cse2 ULTIMATE.start_main_p5)) (= |#memory_int| (store (store (store (store (store (store (store |v_#memory_int_37| 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)) (= (select .cse3 ULTIMATE.start_main_p4) 0)))))) [2018-12-18 22:12:48,115 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p6, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p7]. (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-18 22:12:48,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:48,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2018-12-18 22:12:48,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:48,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-18 22:12:48,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2018-12-18 22:12:50,742 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:12:50,742 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_38| ULTIMATE.start_main_p4))) (and (= (select |v_#memory_int_38| ULTIMATE.start_main_p2) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= (store |v_#memory_int_38| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_38| ULTIMATE.start_main_p6) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 .cse0) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2018-12-18 22:12:50,742 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p6, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p4]. (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-18 22:12:50,855 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;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;#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]; {249#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-18 22:12:50,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {249#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {253#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)))} is VALID [2018-12-18 22:12:50,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {253#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)))} assume !(#memory_int[main_p1] <= 0); {243#false} is VALID [2018-12-18 22:12:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:50,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:12:50,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {245#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} assume !(#memory_int[main_p1] <= 0); {243#false} is VALID [2018-12-18 22:12:50,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {260#(or (= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 1) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {245#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:12:50,902 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;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;#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]; {260#(or (= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:12:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:50,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:12:50,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-18 22:12:50,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:50,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:12:50,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:50,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:12:50,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:50,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:12:50,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:12:50,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:12:50,932 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 4 states. [2018-12-18 22:12:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:51,086 INFO L93 Difference]: Finished difference Result 19 states and 39 transitions. [2018-12-18 22:12:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:51,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:12:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:12:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-12-18 22:12:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:12:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-12-18 22:12:51,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2018-12-18 22:12:51,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:51,212 INFO L225 Difference]: With dead ends: 19 [2018-12-18 22:12:51,212 INFO L226 Difference]: Without dead ends: 18 [2018-12-18 22:12:51,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:12:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-18 22:12:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-18 22:12:51,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:51,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:51,222 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:51,222 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:51,224 INFO L93 Difference]: Finished difference Result 18 states and 38 transitions. [2018-12-18 22:12:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2018-12-18 22:12:51,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:51,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:51,226 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:51,226 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-12-18 22:12:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:51,228 INFO L93 Difference]: Finished difference Result 18 states and 38 transitions. [2018-12-18 22:12:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2018-12-18 22:12:51,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:51,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:51,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:51,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-18 22:12:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2018-12-18 22:12:51,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 3 [2018-12-18 22:12:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:51,232 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 38 transitions. [2018-12-18 22:12:51,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:12:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2018-12-18 22:12:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:51,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:51,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:51,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2018-12-18 22:12:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:51,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:51,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:51,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:12:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:12:51,296 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-18 22:12:51,314 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:12:51,315 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,315 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,315 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,315 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,315 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,315 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,315 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,315 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-12-18 22:12:51,316 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-12-18 22:12:51,317 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-12-18 22:12:51,317 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-12-18 22:12:51,317 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-12-18 22:12:51,317 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-18 22:12:51,317 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-18 22:12:51,319 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:12:51 BoogieIcfgContainer [2018-12-18 22:12:51,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:12:51,321 INFO L168 Benchmark]: Toolchain (without parser) took 9027.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 706.2 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -424.8 MB). Peak memory consumption was 281.5 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:51,322 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:51,322 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:51,323 INFO L168 Benchmark]: Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:51,324 INFO L168 Benchmark]: RCFGBuilder took 1058.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:51,325 INFO L168 Benchmark]: TraceAbstraction took 7868.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -456.5 MB). Peak memory consumption was 249.8 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:51,329 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1058.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7868.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -456.5 MB). Peak memory consumption was 249.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 51]: assertion can be violated assertion can be violated We found a FailurePath: [L61-L62] modifies #valid; [L61-L63] ensures old(#valid)[ptr] == 0; [L61-L64] ensures #valid == old(#valid)[ptr := 1]; [L61-L62] modifies #valid; [L61-L63] ensures old(#valid)[ptr] == 0; [L61-L64] ensures #valid == old(#valid)[ptr := 1]; [L61-L62] modifies #valid; [L61-L63] ensures old(#valid)[ptr] == 0; [L61-L64] ensures #valid == old(#valid)[ptr := 1]; [L61-L62] modifies #valid; [L61-L63] ensures old(#valid)[ptr] == 0; [L61-L64] ensures #valid == old(#valid)[ptr := 1]; [L61-L62] modifies #valid; [L61-L63] ensures old(#valid)[ptr] == 0; [L61-L64] ensures #valid == old(#valid)[ptr := 1]; [L61-L62] modifies #valid; [L61-L63] ensures old(#valid)[ptr] == 0; [L61-L64] ensures #valid == old(#valid)[ptr := 1]; [L61-L62] modifies #valid; [L61-L63] ensures old(#valid)[ptr] == 0; [L61-L64] ensures #valid == old(#valid)[ptr := 1]; [L25] #memory_int[p1] := 0; [L26] #memory_int[p2] := 0; [L27] #memory_int[p3] := 0; [L28] #memory_int[p4] := 0; [L29] #memory_int[p5] := 0; [L30] #memory_int[p6] := 0; [L31] #memory_int[p7] := 0; [L35] #memory_int[p1] := #memory_int[p1] + 1; [L51] assert #memory_int[p1] <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 7 error locations. UNSAFE Result, 7.8s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 48 SDslu, 1 SDs, 0 SdLazy, 106 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 9 ConstructedInterpolants, 2 QuantifiedInterpolants, 513 SizeOfPredicates, 6 NumberOfNonLiveVariables, 23 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...