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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:43:42,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:43:42,229 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:43:42,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:43:42,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:43:42,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:43:42,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:43:42,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:43:42,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:43:42,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:43:42,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:43:42,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:43:42,252 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:43:42,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:43:42,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:43:42,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:43:42,256 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:43:42,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:43:42,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:43:42,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:43:42,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:43:42,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:43:42,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:43:42,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:43:42,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:43:42,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:43:42,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:43:42,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:43:42,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:43:42,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:43:42,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:43:42,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:43:42,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:43:42,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:43:42,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:43:42,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:43:42,278 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:43:42,299 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:43:42,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:43:42,302 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:43:42,302 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:43:42,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:43:42,303 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:43:42,303 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:43:42,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:43:42,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:43:42,304 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:43:42,304 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:43:42,304 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:43:42,304 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:43:42,309 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:43:42,310 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:43:42,310 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:43:42,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:43:42,310 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:43:42,310 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:43:42,311 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:43:42,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:43:42,311 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:43:42,311 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:43:42,311 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:43:42,312 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:43:42,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:43:42,312 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:43:42,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:43:42,312 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:43:42,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:43:42,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:43:42,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:43:42,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:43:42,315 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:43:42,315 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:43:42,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:43:42,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:43:42,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:43:42,317 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:43:42,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:43:42,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:43:42,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:43:42,368 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:43:42,368 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:43:42,369 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-01-07 14:43:42,369 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-07 14:43:42,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:43:42,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:43:42,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:43:42,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:43:42,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:43:42,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,479 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 14:43:42,479 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 14:43:42,479 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 14:43:42,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:43:42,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:43:42,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:43:42,502 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:43:42,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/1) ... [2019-01-07 14:43:42,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:43:42,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:43:42,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:43:42,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:43:42,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43: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 [2019-01-07 14:43:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-07 14:43:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 14:43:42,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 14:43:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-07 14:43:43,172 INFO L278 CfgBuilder]: Using library mode [2019-01-07 14:43:43,172 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-07 14:43:43,173 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:43:43 BoogieIcfgContainer [2019-01-07 14:43:43,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:43:43,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:43:43,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:43:43,179 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:43:43,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:42" (1/2) ... [2019-01-07 14:43:43,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5024507b and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:43:43, skipping insertion in model container [2019-01-07 14:43:43,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:43:43" (2/2) ... [2019-01-07 14:43:43,183 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-07 14:43:43,194 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:43:43,204 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-07 14:43:43,226 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-07 14:43:43,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:43:43,263 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:43:43,263 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:43:43,264 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:43:43,264 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:43:43,264 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:43:43,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:43:43,264 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:43:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-07 14:43:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:43:43,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:43,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 14:43:43,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 14:43:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-07 14:43:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:43,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:43,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:43,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:43,613 INFO L273 TraceCheckUtils]: 0: Hoare triple {14#true} ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];#t~malloc0.base, #t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; {16#(select |#valid| main_~q~1.base)} is VALID [2019-01-07 14:43:43,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {16#(select |#valid| main_~q~1.base)} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {16#(select |#valid| main_~q~1.base)} is VALID [2019-01-07 14:43:43,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {16#(select |#valid| main_~q~1.base)} assume #t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := ~q~1.base, ~q~1.offset, 4; {17#(select |#valid| |main_read~int_#ptr.base|)} is VALID [2019-01-07 14:43:43,622 INFO L273 TraceCheckUtils]: 3: Hoare triple {17#(select |#valid| |main_read~int_#ptr.base|)} assume !#valid[read~int_#ptr.base]; {15#false} is VALID [2019-01-07 14:43:43,624 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:43:43,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:43:43,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 14:43:43,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:43:43,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 14:43:43,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:43,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:43:43,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:43,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:43:43,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:43:43,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:43:43,682 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-07 14:43:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:44,013 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-07 14:43:44,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:43:44,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 14:43:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:43:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-07 14:43:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:43:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-07 14:43:44,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2019-01-07 14:43:44,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:44,235 INFO L225 Difference]: With dead ends: 20 [2019-01-07 14:43:44,236 INFO L226 Difference]: Without dead ends: 10 [2019-01-07 14:43:44,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-07 14:43:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-07 14:43:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-07 14:43:44,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:44,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 7 states. [2019-01-07 14:43:44,300 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 7 states. [2019-01-07 14:43:44,300 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 7 states. [2019-01-07 14:43:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:44,302 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-07 14:43:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-07 14:43:44,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:44,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:44,306 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 10 states. [2019-01-07 14:43:44,306 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 10 states. [2019-01-07 14:43:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:44,308 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-07 14:43:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-07 14:43:44,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:44,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:44,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:44,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:43:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-07 14:43:44,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-07 14:43:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:44,316 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-07 14:43:44,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:43:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 14:43:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 14:43:44,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:44,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 14:43:44,318 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 14:43:44,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-07 14:43:44,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:44,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:44,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:44,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:44,516 INFO L273 TraceCheckUtils]: 0: Hoare triple {72#true} ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];#t~malloc0.base, #t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; {74#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} is VALID [2019-01-07 14:43:44,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {74#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {75#(<= (+ main_~q~1.offset 400) (select |#length| main_~q~1.base))} is VALID [2019-01-07 14:43:44,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {75#(<= (+ main_~q~1.offset 400) (select |#length| main_~q~1.base))} assume #t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := ~q~1.base, ~q~1.offset, 4; {76#(<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 396) (select |#length| |main_read~int_#ptr.base|))} is VALID [2019-01-07 14:43:44,528 INFO L273 TraceCheckUtils]: 3: Hoare triple {76#(<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 396) (select |#length| |main_read~int_#ptr.base|))} assume #valid[read~int_#ptr.base]; {76#(<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 396) (select |#length| |main_read~int_#ptr.base|))} is VALID [2019-01-07 14:43:44,542 INFO L273 TraceCheckUtils]: 4: Hoare triple {76#(<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 396) (select |#length| |main_read~int_#ptr.base|))} assume !(read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]); {73#false} is VALID [2019-01-07 14:43:44,543 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:43:44,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:43:44,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 14:43:44,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:43:44,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-07 14:43:44,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:44,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-07 14:43:44,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:44,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 14:43:44,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 14:43:44,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-07 14:43:44,568 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-07 14:43:44,809 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-07 14:43:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:45,069 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-07 14:43:45,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 14:43:45,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-07 14:43:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:43:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-07 14:43:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:43:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-07 14:43:45,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2019-01-07 14:43:45,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:45,151 INFO L225 Difference]: With dead ends: 17 [2019-01-07 14:43:45,151 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 14:43:45,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-07 14:43:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 14:43:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-07 14:43:45,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:45,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 11 states. [2019-01-07 14:43:45,169 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 11 states. [2019-01-07 14:43:45,170 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 11 states. [2019-01-07 14:43:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:45,172 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-07 14:43:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-01-07 14:43:45,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:45,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:45,173 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 16 states. [2019-01-07 14:43:45,173 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 16 states. [2019-01-07 14:43:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:45,175 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-07 14:43:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-01-07 14:43:45,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:45,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:45,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:45,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 14:43:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-07 14:43:45,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-07 14:43:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:45,179 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-07 14:43:45,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 14:43:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-07 14:43:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 14:43:45,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:45,180 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-07 14:43:45,180 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 14:43:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-07 14:43:45,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:45,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:45,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:45,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:45,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:45,269 INFO L273 TraceCheckUtils]: 0: Hoare triple {146#true} ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];#t~malloc0.base, #t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; {146#true} is VALID [2019-01-07 14:43:45,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {146#true} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {146#true} is VALID [2019-01-07 14:43:45,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {146#true} assume !#t~short2; {148#(not |main_#t~short2|)} is VALID [2019-01-07 14:43:45,271 INFO L273 TraceCheckUtils]: 3: Hoare triple {148#(not |main_#t~short2|)} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;#t~post3.base, #t~post3.offset := ~q~1.base, ~q~1.offset;~q~1.base, ~q~1.offset := #t~post3.base, #t~post3.offset + 4;havoc #t~post3.base, #t~post3.offset; {147#false} is VALID [2019-01-07 14:43:45,272 INFO L273 TraceCheckUtils]: 4: Hoare triple {147#false} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {147#false} is VALID [2019-01-07 14:43:45,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {147#false} assume #t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := ~q~1.base, ~q~1.offset, 4; {147#false} is VALID [2019-01-07 14:43:45,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {147#false} assume #valid[read~int_#ptr.base]; {147#false} is VALID [2019-01-07 14:43:45,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {147#false} assume !(read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]); {147#false} is VALID [2019-01-07 14:43:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:45,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:43:45,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 14:43:45,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:43:45,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-07 14:43:45,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:45,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:43:45,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:45,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:43:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:43:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:43:45,331 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-07 14:43:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:45,526 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-07 14:43:45,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:43:45,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-07 14:43:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:43:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-07 14:43:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:43:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-07 14:43:45,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-07 14:43:45,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:45,607 INFO L225 Difference]: With dead ends: 18 [2019-01-07 14:43:45,607 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 14:43:45,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:43:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 14:43:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 14:43:45,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:45,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-01-07 14:43:45,621 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 14:43:45,621 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 14:43:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:45,623 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 14:43:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 14:43:45,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:45,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:45,624 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 14:43:45,624 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 14:43:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:45,625 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 14:43:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 14:43:45,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:45,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:45,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:45,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 14:43:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-07 14:43:45,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-07 14:43:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:45,628 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-07 14:43:45,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:43:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 14:43:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 14:43:45,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:45,629 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-07 14:43:45,629 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 14:43:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-07 14:43:45,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:45,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:45,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:45,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:45,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:45,818 INFO L273 TraceCheckUtils]: 0: Hoare triple {207#true} ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];#t~malloc0.base, #t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} is VALID [2019-01-07 14:43:45,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} is VALID [2019-01-07 14:43:45,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} assume #t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := ~q~1.base, ~q~1.offset, 4; {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} is VALID [2019-01-07 14:43:45,827 INFO L273 TraceCheckUtils]: 3: Hoare triple {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} assume #valid[read~int_#ptr.base]; {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} is VALID [2019-01-07 14:43:45,829 INFO L273 TraceCheckUtils]: 4: Hoare triple {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} assume read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base];assume #valid[read~int_#ptr.base];assume read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base];havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];#t~mem1 := read~int_#value;#t~short2 := #t~mem1 >= 0; {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} is VALID [2019-01-07 14:43:45,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {209#(and (= main_~p~1.offset main_~q~1.offset) (<= (+ main_~p~1.offset 400) (select |#length| main_~q~1.base)))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;#t~post3.base, #t~post3.offset := ~q~1.base, ~q~1.offset;~q~1.base, ~q~1.offset := #t~post3.base, #t~post3.offset + 4;havoc #t~post3.base, #t~post3.offset; {210#(<= (+ main_~q~1.offset 396) (select |#length| main_~q~1.base))} is VALID [2019-01-07 14:43:45,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {210#(<= (+ main_~q~1.offset 396) (select |#length| main_~q~1.base))} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {210#(<= (+ main_~q~1.offset 396) (select |#length| main_~q~1.base))} is VALID [2019-01-07 14:43:45,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {210#(<= (+ main_~q~1.offset 396) (select |#length| main_~q~1.base))} assume #t~short2;read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := ~q~1.base, ~q~1.offset, 4; {211#(<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) (select |#length| |main_read~int_#ptr.base|))} is VALID [2019-01-07 14:43:45,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {211#(<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) (select |#length| |main_read~int_#ptr.base|))} assume #valid[read~int_#ptr.base]; {211#(<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) (select |#length| |main_read~int_#ptr.base|))} is VALID [2019-01-07 14:43:45,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {211#(<= (+ |main_read~int_#ptr.offset| |main_read~int_#sizeOfReadType| 392) (select |#length| |main_read~int_#ptr.base|))} assume !(read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]); {208#false} is VALID [2019-01-07 14:43:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:45,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:45,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:43:45,842 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-07 14:43:45,843 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-07 14:43:45,904 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:43:45,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:43:46,736 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 14:43:46,736 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 14:43:46,737 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:43:46,738 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:43:46,738 WARN L224 ngHoareTripleChecker]: Pre: {2147483647#(forall ((v_idx_7 Int) (v_idx_8 Int) (v_idx_9 Int) (v_idx_3 Int) (v_idx_10 Int) (v_idx_4 Int) (v_idx_5 Int) (v_idx_6 Int) (v_idx_1 Int) (v_idx_2 Int)) (exists ((v_v_8_1 Int) (v_v_3_1 Bool) (v_v_4_1 Bool) (v_v_0_1 Int) (v_v_7_1 (Array Int Int)) (v_v_1_1 Int) (v_v_2_1 Int) (v_v_5_1 (Array Int Int)) (v_v_9_1 Bool) (v_v_6_1 Int)) (and (= (select |c_old(#length)| v_idx_9) v_v_2_1) (= (select v_v_5_1 v_idx_3) v_v_6_1) (= (select |c_main_~malloc_old_#length| v_idx_2) v_v_0_1) (= (select |c_old(#valid)| v_idx_5) v_v_4_1) (= v_v_9_1 (select |c_main_~malloc_old_#valid| v_idx_10)) (= (select |c_#length| v_idx_8) v_v_1_1) (= (select v_v_7_1 v_idx_1) v_v_8_1) (= v_v_5_1 (select |c_#memory_int| v_idx_6)) (= v_v_3_1 (select |c_#valid| v_idx_4)) (= (select |c_old(#memory_int)| v_idx_7) v_v_7_1))))} [2019-01-07 14:43:46,738 WARN L228 ngHoareTripleChecker]: Action: ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];#t~malloc0.base, #t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; [2019-01-07 14:43:46,739 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (select |c_main_~malloc_old_#valid_primed| |c_main_~malloc_#res.base_primed|)) (= |c_main_#t~malloc0.offset_primed| |c_main_~malloc_#res.offset_primed|) (= (store |c_main_~malloc_old_#length_primed| |c_main_~malloc_#res.base_primed| c_main_~malloc_~size_primed) |c_#length_primed|) (= |c_main_~malloc_old_#valid_primed| |c_#valid|) (= |c_main_~malloc_old_#length_primed| |c_#length|) (= (store |c_main_~malloc_old_#valid_primed| |c_main_~malloc_#res.base_primed| true) |c_#valid_primed|) (= c_main_~q~1.offset_primed c_main_~p~1.offset_primed) (= 0 |c_main_~malloc_#res.offset_primed|) (= |c_main_#t~malloc0.base_primed| |c_main_~malloc_#res.base_primed|) (= c_main_~p~1.base_primed |c_main_#t~malloc0.base_primed|) (= c_main_~q~1.base_primed c_main_~p~1.base_primed) (= c_main_~malloc_~size_primed 400) (= c_main_~p~1.offset_primed |c_main_#t~malloc0.offset_primed|) (not (= |c_main_~malloc_#res.base_primed| 0))) [2019-01-07 14:43:46,740 WARN L230 ngHoareTripleChecker]: Post: {2147483646#(forall ((v_idx_14 Int) (v_idx_15 Int) (v_idx_23 Int) (v_idx_12 Int) (v_idx_24 Int) (v_idx_13 Int) (v_idx_21 Int) (v_idx_22 Int) (v_idx_11 Int) (v_idx_20 Int) (v_idx_18 Int) (v_idx_19 Int) (v_idx_16 Int) (v_idx_17 Int)) (exists ((v_v_24_1 Int) (v_v_25_1 Int) (v_b_4_1 Int) (v_b_5_1 Int) (v_b_8_1 Int) (v_b_9_1 Int) (v_v_4_1 Bool) (v_v_26_1 Int) (v_v_8_1 Int) (v_v_19_1 Bool) (v_v_18_1 Bool) (v_v_12_1 Bool) (v_v_7_1 (Array Int Int)) (v_v_1_1 Int) (v_v_5_1 (Array Int Int)) (v_v_2_1 Int) (v_v_6_1 Int) (v_v_20_1 Bool)) (and (<= (- (- |c_main_#t~malloc0.offset|) (- v_v_25_1)) 400) (<= (- (- |c_main_#t~malloc0.offset|) c_main_~q~1.offset) 0) (<= (- |c_main_#t~malloc0.offset| (- c_main_~malloc_~size)) 400) (<= (- (- c_main_~malloc_~size) v_v_25_1) (- 800)) (<= (- (- c_main_~malloc_~size) (- c_main_~p~1.offset)) (- 400)) (<= (- (- |c_main_~malloc_#res.offset|) (- c_main_~q~1.offset)) 0) (= v_b_9_1 (+ v_b_8_1 1)) (<= (- |c_main_#t~malloc0.offset| (- |c_main_~malloc_#res.offset|)) 0) (<= (- (- |c_main_~malloc_#res.offset|) c_main_~malloc_~size) (- 400)) v_v_19_1 (<= (- (- v_b_4_1) (- |c_main_~malloc_#res.base|)) 0) (= (+ v_b_5_1 (- 1)) |c_main_~malloc_#res.base|) (<= (- (- c_main_~q~1.offset) (- v_v_25_1)) 400) (<= (- (- c_main_~malloc_~size) c_main_~p~1.offset) (- 400)) (<= (- (- |c_main_~malloc_#res.offset|) (- c_main_~p~1.offset)) 0) (<= (- (- v_b_5_1) (- |c_main_~malloc_#res.base|)) (- 1)) (<= (- (- v_b_9_1) (- |c_main_~malloc_#res.base|)) (- 1)) (<= (- (- |c_main_#t~malloc0.offset|) c_main_~p~1.offset) 0) (<= (- v_b_8_1 v_b_9_1) (- 1)) (<= (- (- |c_main_~malloc_#res.offset|) (- c_main_~malloc_~size)) 400) (<= (- v_b_9_1 |c_main_~malloc_#res.base|) 1) (<= (- |c_main_~malloc_#res.offset| (- v_v_25_1)) 400) (= (+ v_b_8_1 1) (+ v_b_4_1 1)) (= (select |c_main_~malloc_old_#valid| v_idx_24) v_v_12_1) (<= (- (- c_main_~p~1.offset) v_v_25_1) (- 400)) (<= (- v_b_8_1 |c_main_~malloc_#res.base|) 0) (= v_v_5_1 (select |c_#memory_int| v_idx_18)) (= v_v_7_1 (select |c_old(#memory_int)| v_idx_19)) (<= (- c_main_~malloc_~size (- c_main_~p~1.offset)) 400) (= v_b_5_1 (+ v_b_8_1 1)) (<= (- |c_main_#t~malloc0.offset| |c_main_~malloc_#res.offset|) 0) (<= (- |c_main_#t~malloc0.offset| (- c_main_~p~1.offset)) 0) (<= (- |c_main_~malloc_#res.offset| (- c_main_~q~1.offset)) 0) (or (< v_idx_22 v_b_8_1) (= (select |c_#length| v_idx_22) v_v_25_1) (<= v_b_9_1 v_idx_22)) (= |c_main_~malloc_#res.base| (+ v_b_9_1 (- 1))) (<= (- |c_main_#t~malloc0.offset| (- |c_main_#t~malloc0.offset|)) 0) (<= (- v_v_25_1 (- v_v_25_1)) 800) (<= (- c_main_~malloc_~size (- c_main_~malloc_~size)) 800) (or (= v_v_20_1 (select |c_#valid| v_idx_17)) (< v_idx_17 v_b_5_1)) (<= (- |c_main_#t~malloc0.offset| (- v_v_25_1)) 400) (= (select |c_old(#valid)| v_idx_14) v_v_4_1) (= v_v_6_1 (select v_v_5_1 v_idx_13)) (<= (- (- |c_main_#t~malloc0.offset|) (- c_main_~p~1.offset)) 0) (<= (- |c_main_#t~malloc0.offset| c_main_~p~1.offset) 0) (<= (- (- v_v_25_1) v_v_25_1) (- 800)) (= |c_main_~malloc_#res.base| v_b_4_1) (<= (- c_main_~p~1.offset v_v_25_1) (- 400)) (<= (- (- c_main_~p~1.offset) c_main_~p~1.offset) 0) (<= (- (- |c_main_#t~malloc0.offset|) c_main_~malloc_~size) (- 400)) (<= (- c_main_~malloc_~size v_v_25_1) 0) (<= (- v_b_5_1 v_b_9_1) 0) (<= (- |c_main_#t~malloc0.offset| c_main_~q~1.offset) 0) (<= (- c_main_~q~1.offset v_v_25_1) (- 400)) (<= (- c_main_~malloc_~size (- v_v_25_1)) 800) (<= (- (- c_main_~malloc_~size) (- v_v_25_1)) 0) (<= (- c_main_~malloc_~size c_main_~q~1.offset) 400) (or (< v_idx_16 v_b_4_1) (<= v_b_5_1 v_idx_16) (= (select |c_#valid| v_idx_16) v_v_19_1)) (<= (- (- v_b_8_1) (- |c_main_~malloc_#res.base|)) 0) (<= (- c_main_~malloc_~size (- c_main_~q~1.offset)) 400) (<= (- |c_main_#t~malloc0.offset| c_main_~malloc_~size) (- 400)) (<= (- c_main_~p~1.offset c_main_~q~1.offset) 0) (<= (- |c_main_~malloc_#res.offset| (- c_main_~malloc_~size)) 400) (= (+ |c_main_~malloc_#res.base| 1) (+ v_b_8_1 1)) (or (= (select |c_#length| v_idx_23) v_v_26_1) (< v_idx_23 v_b_9_1)) (<= (- (- |c_main_#t~malloc0.offset|) (- c_main_~q~1.offset)) 0) (<= (- c_main_~p~1.offset (- c_main_~q~1.offset)) 0) (<= (- (- c_main_~p~1.offset) (- c_main_~q~1.offset)) 0) (= (select |c_old(#length)| v_idx_20) v_v_2_1) (<= (- (- c_main_~malloc_~size) c_main_~q~1.offset) (- 400)) (<= (- v_b_4_1 v_b_9_1) (- 1)) (<= (- (- c_main_~malloc_~size) (- c_main_~q~1.offset)) (- 400)) (<= (- (- v_b_4_1) (- v_b_5_1)) 1) (<= (- c_main_~q~1.offset (- v_v_25_1)) 400) (<= (- (- |c_main_#t~malloc0.offset|) v_v_25_1) (- 400)) (<= (- v_b_4_1 v_b_5_1) (- 1)) (<= (- (- |c_main_#t~malloc0.offset|) |c_main_~malloc_#res.offset|) 0) (<= (- (- c_main_~q~1.offset) v_v_25_1) (- 400)) (<= (- |c_main_~malloc_#res.offset| v_v_25_1) (- 400)) (<= (- (- |c_main_~malloc_#res.offset|) (- v_v_25_1)) 400) (<= (- |c_main_~malloc_#res.offset| c_main_~malloc_~size) (- 400)) (<= (- |c_main_~malloc_#res.offset| c_main_~q~1.offset) 0) (<= (- |c_main_#t~malloc0.offset| (- c_main_~q~1.offset)) 0) (<= (- (- |c_main_#t~malloc0.offset|) (- |c_main_~malloc_#res.offset|)) 0) (or (= (select |c_#length| v_idx_21) v_v_24_1) (<= v_b_8_1 v_idx_21)) (<= (- (- |c_main_~malloc_#res.offset|) |c_main_~malloc_#res.offset|) 0) (<= (- |c_main_~malloc_#res.offset| c_main_~p~1.offset) 0) (<= (- (- c_main_~p~1.offset) (- v_v_25_1)) 400) (<= (- (- v_b_5_1) (- v_b_9_1)) 0) (<= (- (- c_main_~q~1.offset) c_main_~q~1.offset) 0) (<= (- (- v_b_4_1) (- v_b_9_1)) 1) (<= (- |c_main_~malloc_#res.offset| (- c_main_~p~1.offset)) 0) (<= (- v_b_5_1 v_b_8_1) 1) (= (select v_v_7_1 v_idx_11) v_v_8_1) (or (<= v_b_4_1 v_idx_15) (= (select |c_#valid| v_idx_15) v_v_18_1)) (<= (- c_main_~malloc_~size c_main_~p~1.offset) 400) (<= (- (- c_main_~malloc_~size) c_main_~malloc_~size) (- 800)) (<= (- (- |c_main_#t~malloc0.offset|) |c_main_#t~malloc0.offset|) 0) (<= (- (- v_b_4_1) (- v_b_8_1)) 0) (<= (- (- |c_main_~malloc_#res.offset|) c_main_~q~1.offset) 0) (= |c_main_~malloc_#res.base| v_b_8_1) (= (select |c_main_~malloc_old_#length| v_idx_12) v_v_1_1) (<= (- (- |c_main_~malloc_#res.offset|) v_v_25_1) (- 400)) (<= (- (- |c_main_~malloc_#res.offset|) c_main_~p~1.offset) 0) (<= (- c_main_~p~1.offset (- v_v_25_1)) 400) (<= (- |c_main_~malloc_#res.offset| (- |c_main_~malloc_#res.offset|)) 0) (<= (- |c_main_#t~malloc0.offset| v_v_25_1) (- 400)) (<= (- (- v_b_5_1) (- v_b_8_1)) (- 1)) (<= (- c_main_~q~1.offset (- c_main_~q~1.offset)) 0) (<= (- (- |c_main_#t~malloc0.offset|) (- c_main_~malloc_~size)) 400) (<= (- (- v_b_8_1) (- v_b_9_1)) 1) (<= (- v_b_4_1 |c_main_~malloc_#res.base|) 0) (<= (- c_main_~p~1.offset (- c_main_~p~1.offset)) 0) (<= (- (- c_main_~p~1.offset) c_main_~q~1.offset) 0) (<= (- v_b_4_1 v_b_8_1) 0) (<= (- v_b_5_1 |c_main_~malloc_#res.base|) 1))))} [2019-01-07 14:43:46,741 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:43:46,742 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:43:46,742 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:43:46,861 WARN L270 ngHoareTripleChecker]: Pre: {2147483647#true} [2019-01-07 14:43:46,862 WARN L274 ngHoareTripleChecker]: Action: ~malloc_old_#length, ~malloc_old_#valid := #length, #valid;~malloc_~size := 400;havoc ~malloc_#res.base, ~malloc_#res.offset;havoc #valid, #length;assume ~malloc_old_#valid[~malloc_#res.base] == false;assume #valid == ~malloc_old_#valid[~malloc_#res.base := true];assume ~malloc_#res.offset == 0;assume ~malloc_#res.base != 0;assume #length == ~malloc_old_#length[~malloc_#res.base := ~malloc_~size];#t~malloc0.base, #t~malloc0.offset := ~malloc_#res.base, ~malloc_#res.offset;~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; [2019-01-07 14:43:46,863 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (select |c_main_~malloc_old_#valid_primed| |c_main_~malloc_#res.base_primed|)) (= |c_main_#t~malloc0.offset_primed| |c_main_~malloc_#res.offset_primed|) (= (store |c_main_~malloc_old_#length_primed| |c_main_~malloc_#res.base_primed| c_main_~malloc_~size_primed) |c_#length_primed|) (= |c_main_~malloc_old_#valid_primed| |c_#valid|) (= |c_main_~malloc_old_#length_primed| |c_#length|) (= (store |c_main_~malloc_old_#valid_primed| |c_main_~malloc_#res.base_primed| true) |c_#valid_primed|) (= c_main_~q~1.offset_primed c_main_~p~1.offset_primed) (= 0 |c_main_~malloc_#res.offset_primed|) (= |c_main_#t~malloc0.base_primed| |c_main_~malloc_#res.base_primed|) (= c_main_~p~1.base_primed |c_main_#t~malloc0.base_primed|) (= c_main_~q~1.base_primed c_main_~p~1.base_primed) (= c_main_~malloc_~size_primed 400) (= c_main_~p~1.offset_primed |c_main_#t~malloc0.offset_primed|) (not (= |c_main_~malloc_#res.base_primed| 0)))