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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:57:51,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:57:51,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:57:51,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:57:51,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:57:51,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:57:51,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:57:51,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:57:51,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:57:51,132 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:57:51,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:57:51,135 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:57:51,137 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:57:51,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:57:51,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:57:51,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:57:51,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:57:51,152 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:57:51,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:57:51,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:57:51,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:57:51,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:57:51,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:57:51,165 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:57:51,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:57:51,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:57:51,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:57:51,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:57:51,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:57:51,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:57:51,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:57:51,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:57:51,173 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:57:51,173 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:57:51,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:57:51,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:57:51,178 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 14:57:51,200 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:57:51,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:57:51,201 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:57:51,202 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:57:51,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:57:51,202 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:57:51,202 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:57:51,202 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:57:51,203 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:57:51,203 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:57:51,203 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:57:51,203 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:57:51,203 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:57:51,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:57:51,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:57:51,204 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:57:51,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:57:51,205 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:57:51,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:57:51,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:57:51,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:57:51,205 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:57:51,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:57:51,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:57:51,206 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:57:51,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:57:51,206 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:57:51,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:57:51,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:57:51,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:57:51,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:57:51,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:57:51,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:57:51,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:57:51,208 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:57:51,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:57:51,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:57:51,208 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:57:51,209 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:57:51,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:57:51,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:57:51,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:57:51,270 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:57:51,271 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:57:51,272 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-01-07 14:57:51,272 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-01-07 14:57:51,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:57:51,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:57:51,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:57:51,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:57:51,322 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:57:51,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:57:51,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:57:51,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:57:51,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:57:51,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/1) ... [2019-01-07 14:57:51,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:57:51,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:57:51,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:57:51,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:57:51,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (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-01-07 14:57:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:57:51,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:57:52,127 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:57:52,127 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-07 14:57:52,128 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:57:52 BoogieIcfgContainer [2019-01-07 14:57:52,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:57:52,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:57:52,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:57:52,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:57:52,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:57:51" (1/2) ... [2019-01-07 14:57:52,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493467ce and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:57:52, skipping insertion in model container [2019-01-07 14:57:52,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:57:52" (2/2) ... [2019-01-07 14:57:52,137 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-01-07 14:57:52,148 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:57:52,156 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-07 14:57:52,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-07 14:57:52,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:57:52,209 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:57:52,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:57:52,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:57:52,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:57:52,209 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:57:52,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:57:52,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:57:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-07 14:57:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 14:57:52,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:57:52,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 14:57:52,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:57:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:57:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-07 14:57:52,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:57:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:57:52,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:57:52,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:57:52,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:57:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:57:52,474 INFO L273 TraceCheckUtils]: 0: Hoare triple {14#true} havoc main_p1, main_p2, main_p3, main_p4;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;#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]; {16#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 14:57:52,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {16#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {15#false} is VALID [2019-01-07 14:57:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:57:52,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:57:52,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 14:57:52,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:57:52,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:57:52,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:57:52,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:57:52,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:57:52,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:57:52,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:57:52,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:57:52,547 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-07 14:57:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:57:52,820 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-07 14:57:52,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:57:52,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:57:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:57:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:57:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-07 14:57:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:57:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-07 14:57:52,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2019-01-07 14:57:53,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:57:53,080 INFO L225 Difference]: With dead ends: 21 [2019-01-07 14:57:53,080 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 14:57:53,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:57:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 14:57:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-07 14:57:53,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:57:53,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 10 states. [2019-01-07 14:57:53,135 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 10 states. [2019-01-07 14:57:53,135 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 10 states. [2019-01-07 14:57:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:57:53,139 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2019-01-07 14:57:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-01-07 14:57:53,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:57:53,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:57:53,140 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 16 states. [2019-01-07 14:57:53,140 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 16 states. [2019-01-07 14:57:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:57:53,144 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2019-01-07 14:57:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-01-07 14:57:53,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:57:53,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:57:53,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:57:53,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:57:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 14:57:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-07 14:57:53,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-07 14:57:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:57:53,150 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-07 14:57:53,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:57:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-07 14:57:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:57:53,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:57:53,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:57:53,151 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:57:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:57:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-07 14:57:53,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:57:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:57:53,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:57:53,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:57:53,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:57:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:57:53,278 INFO L273 TraceCheckUtils]: 0: Hoare triple {86#true} havoc main_p1, main_p2, main_p3, main_p4;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;#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]; {88#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2019-01-07 14:57:53,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {88#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {89#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 14:57:53,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {89#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {87#false} is VALID [2019-01-07 14:57:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:57:53,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:57:53,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:57:53,290 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 14:57:53,293 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-07 14:57:53,358 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:57:53,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:57:57,271 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 14:57:57,271 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 14:57:57,272 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:57:57,273 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:57:57,273 WARN L224 ngHoareTripleChecker]: Pre: {2147483647#(forall ((v_idx_3 Int) (v_idx_4 Int) (v_idx_5 Int) (v_idx_1 Int) (v_idx_2 Int)) (exists ((v_v_0_1 Int) (v_v_1_1 Int) (v_v_2_1 Int) (v_v_3_1 Int) (v_v_4_1 Int)) (and (= (select |c_old(#memory_int)| v_idx_5) v_v_4_1) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_1) v_v_0_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_3)) (= v_v_1_1 (select |c_#valid| v_idx_2)) (= v_v_3_1 (select |c_#memory_int| v_idx_4)))))} [2019-01-07 14:57:57,274 WARN L228 ngHoareTripleChecker]: Action: havoc main_p1, main_p2, main_p3, main_p4;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;#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]; [2019-01-07 14:57:57,275 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed 1) |c_#valid_primed|) (= (store (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed 1) |c_ULTIMATE.start_malloc_old_#valid_primed|) (= (select |c_#valid| c_ULTIMATE.start_main_p1_primed) 0) (= c_ULTIMATE.start_main_p4_primed c_ULTIMATE.start_malloc_ptr_primed) (= |c_#memory_int_primed| (store (store (store (store |c_#memory_int| c_ULTIMATE.start_main_p1_primed 0) c_ULTIMATE.start_main_p2_primed 0) c_ULTIMATE.start_main_p3_primed 0) c_ULTIMATE.start_main_p4_primed 0)) (= 0 (select (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed)) (= (select (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed) 0) (= (select |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed) 0)) [2019-01-07 14:57:57,275 WARN L230 ngHoareTripleChecker]: Post: {2147483646#(forall ((v_idx_7 Int) (v_idx_14 Int) (v_idx_8 Int) (v_idx_15 Int) (v_idx_9 Int) (v_idx_12 Int) (v_idx_13 Int) (v_idx_10 Int) (v_idx_11 Int) (v_idx_6 Int) (v_idx_16 Int)) (exists ((v_v_55_1 Int) (v_v_36_1 Int) (v_v_56_1 Int) (v_v_44_1 Int) (v_v_43_1 Int) (v_v_42_1 Int) (v_v_54_1 Int) (v_b_19_1 Int) (v_v_38_1 Int) (v_v_37_1 Int) (v_b_23_1 Int) (v_b_31_1 Int) (v_b_22_1 Int) (v_b_30_1 Int) (v_b_18_1 Int) (v_v_2_1 Int) (v_v_4_1 Int)) (and (<= (- (- v_b_18_1) (- v_b_19_1)) 1) (= (+ c_ULTIMATE.start_main_p4 1) v_b_23_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_13)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_18_1) 0) (<= (- v_b_22_1 v_b_23_1) (- 1)) (<= (- v_v_55_1 (- v_v_55_1)) 0) (<= (- (- v_b_30_1) (- v_b_31_1)) 1) (<= (- (- c_ULTIMATE.start_main_p4) (- v_b_22_1)) 0) (= v_b_30_1 c_ULTIMATE.start_main_p4) (<= (- v_b_18_1 v_b_22_1) 0) (= v_b_18_1 c_ULTIMATE.start_main_p4) (<= (- v_v_37_1 (- v_v_55_1)) 0) (or (<= v_b_18_1 v_idx_10) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_10) v_v_36_1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_18_1)) 0) (<= (- c_ULTIMATE.start_main_p4 v_b_31_1) (- 1)) (<= (- v_b_19_1 v_b_31_1) 0) (<= (- c_ULTIMATE.start_main_p4 v_b_18_1) 0) (<= (- (- v_v_37_1) v_v_55_1) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_31_1)) 1) (<= (- (- v_v_37_1) v_v_43_1) (- 1)) (<= (- v_b_19_1 v_b_22_1) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_30_1)) 0) (<= (- v_v_43_1 v_v_55_1) 1) (= v_b_22_1 c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_11) v_v_37_1) (<= v_b_19_1 v_idx_11) (< v_idx_11 v_b_18_1)) (<= (- (- v_b_18_1) (- v_b_23_1)) 1) (<= (- (- v_b_22_1) (- v_b_31_1)) 1) (<= (- (- c_ULTIMATE.start_main_p4) (- v_b_18_1)) 0) (<= (- v_b_22_1 v_b_30_1) 0) (<= (- (- v_b_18_1) (- v_b_22_1)) 0) (or (< v_idx_15 v_b_22_1) (<= v_b_23_1 v_idx_15) (= (select |c_#valid| v_idx_15) v_v_43_1)) (<= (- v_b_18_1 v_b_31_1) (- 1)) (<= (- c_ULTIMATE.start_main_p4 v_b_19_1) (- 1)) (or (<= v_b_31_1 v_idx_8) (< v_idx_8 v_b_30_1) (= v_v_55_1 (select |c_#memory_int| v_idx_8))) (= (+ v_b_23_1 (- 1)) c_ULTIMATE.start_main_p4) (<= (- (- c_ULTIMATE.start_main_p4) (- v_b_31_1)) 1) (<= (- v_v_37_1 v_v_43_1) (- 1)) (<= (- (- v_v_43_1) v_v_55_1) (- 1)) (<= (- v_b_30_1 v_b_31_1) (- 1)) (= (+ c_ULTIMATE.start_main_p4 1) v_b_31_1) (<= (- (- c_ULTIMATE.start_main_p4) (- v_b_19_1)) 1) (<= (- c_ULTIMATE.start_main_p4 v_b_30_1) 0) (<= (- v_v_37_1 (- v_v_43_1)) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_31_1) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_23_1)) 1) (<= (- v_b_18_1 v_b_30_1) 0) (<= (- v_v_43_1 (- v_v_43_1)) 2) (or (= (select |c_#valid| v_idx_14) v_v_42_1) (<= v_b_22_1 v_idx_14)) (<= (- (- v_b_18_1) (- v_b_30_1)) 0) (= (select |c_old(#memory_int)| v_idx_6) v_v_4_1) (<= (- c_ULTIMATE.start_main_p4 v_b_22_1) 0) (<= (- (- v_v_37_1) (- v_v_43_1)) 1) (<= (- v_b_19_1 v_b_30_1) 1) (<= (- (- v_v_55_1) v_v_55_1) 0) (<= (- (- v_b_19_1) (- v_b_23_1)) 0) (<= (- (- v_b_19_1) (- v_b_30_1)) (- 1)) (<= (- v_b_23_1 v_b_31_1) 0) (or (<= v_b_30_1 v_idx_7) (= (select |c_#memory_int| v_idx_7) v_v_54_1)) (or (= (select |c_#memory_int| v_idx_9) v_v_56_1) (< v_idx_9 v_b_31_1)) (<= (- v_b_18_1 v_b_23_1) (- 1)) (= (+ v_b_31_1 (- 1)) c_ULTIMATE.start_main_p4) (<= (- (- v_b_18_1) (- v_b_31_1)) 1) (<= (- (- c_ULTIMATE.start_main_p4) (- v_b_30_1)) 0) (<= (- v_v_37_1 v_v_55_1) 0) (<= (- v_b_18_1 v_b_19_1) (- 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_30_1) 0) (<= (- (- v_v_43_1) v_v_43_1) (- 2)) (<= (- v_b_19_1 v_b_23_1) 0) (<= (- (- v_v_37_1) v_v_37_1) 0) (= (+ v_b_18_1 1) (+ c_ULTIMATE.start_main_p4 1)) (= (+ c_ULTIMATE.start_main_p4 1) v_b_19_1) (= (+ c_ULTIMATE.start_main_p4 1) (+ v_b_22_1 1)) (= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p4) (<= (- (- v_b_19_1) (- v_b_31_1)) 0) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) 0) (= (+ c_ULTIMATE.start_malloc_ptr 1) (+ c_ULTIMATE.start_main_p4 1)) (<= (- (- v_b_22_1) (- v_b_30_1)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_22_1) 0) (<= (- v_b_23_1 v_b_30_1) 1) (<= (- (- v_v_37_1) (- v_v_55_1)) 0) (<= (- (- v_v_43_1) (- v_v_55_1)) (- 1)) (= c_ULTIMATE.start_main_p4 (+ v_b_19_1 (- 1))) (<= (- (- v_b_19_1) (- v_b_22_1)) (- 1)) (<= (- v_v_37_1 (- v_v_37_1)) 0) (or (= (select |c_#valid| v_idx_16) v_v_44_1) (< v_idx_16 v_b_23_1)) (<= (- (- c_ULTIMATE.start_main_p4) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- c_ULTIMATE.start_main_p4 v_b_23_1) (- 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_23_1) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_22_1)) 0) (<= (- (- v_b_23_1) (- v_b_31_1)) 0) (<= (- v_b_22_1 v_b_31_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p4) (- v_b_23_1)) 1) (<= (- (- v_b_23_1) (- v_b_30_1)) (- 1)) (<= (- (- v_b_22_1) (- v_b_23_1)) 1) (= (+ c_ULTIMATE.start_main_p4 1) (+ v_b_30_1 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_19_1) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_19_1)) 1) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_12) v_v_38_1) (< v_idx_12 v_b_19_1)) (<= (- v_v_43_1 (- v_v_55_1)) 1))))} [2019-01-07 14:57:57,276 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:57:57,315 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:57:57,315 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:57:57,340 WARN L270 ngHoareTripleChecker]: Pre: {2147483647#true} [2019-01-07 14:57:57,340 WARN L274 ngHoareTripleChecker]: Action: havoc main_p1, main_p2, main_p3, main_p4;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;#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]; [2019-01-07 14:57:57,341 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed 1) |c_#valid_primed|) (= (store (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed 1) |c_ULTIMATE.start_malloc_old_#valid_primed|) (= (select |c_#valid| c_ULTIMATE.start_main_p1_primed) 0) (= c_ULTIMATE.start_main_p4_primed c_ULTIMATE.start_malloc_ptr_primed) (= |c_#memory_int_primed| (store (store (store (store |c_#memory_int| c_ULTIMATE.start_main_p1_primed 0) c_ULTIMATE.start_main_p2_primed 0) c_ULTIMATE.start_main_p3_primed 0) c_ULTIMATE.start_main_p4_primed 0)) (= 0 (select (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed)) (= (select (store (store |c_#valid| c_ULTIMATE.start_main_p1_primed 1) c_ULTIMATE.start_main_p2_primed 1) c_ULTIMATE.start_main_p3_primed) 0) (= (select |c_ULTIMATE.start_malloc_old_#valid_primed| c_ULTIMATE.start_malloc_ptr_primed) 0))