java -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_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:20,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:20,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:20,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:20,884 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:20,885 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:20,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:20,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:20,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:20,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:20,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:20,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:20,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:20,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:20,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:20,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:20,908 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:20,913 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:20,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:20,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:20,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:20,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:20,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:20,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:20,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:20,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:20,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:20,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:20,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:20,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:20,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:20,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:20,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:20,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:20,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:20,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:20,945 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:38:20,966 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:20,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:20,967 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:20,967 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:20,967 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:20,967 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:20,968 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:20,968 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:20,969 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:20,970 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:20,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:20,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:20,971 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:20,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:20,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:20,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:20,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:20,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:20,973 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:20,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:20,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:20,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:20,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:20,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:20,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:20,977 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:21,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:21,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:21,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:21,035 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:21,035 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:21,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl [2019-03-04 16:38:21,037 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/verisec_NetBSD-libc__loop.i_2.bpl' [2019-03-04 16:38:21,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:21,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:21,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:21,079 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:21,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:21,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:21,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:21,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:21,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:21,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (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-03-04 16:38:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:38:21,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:38:21,495 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:38:21,495 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-03-04 16:38:21,497 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21 BoogieIcfgContainer [2019-03-04 16:38:21,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:21,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:21,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:21,501 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:21,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/2) ... [2019-03-04 16:38:21,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fb04f2 and model type verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:21, skipping insertion in model container [2019-03-04 16:38:21,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21" (2/2) ... [2019-03-04 16:38:21,505 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc__loop.i_2.bpl [2019-03-04 16:38:21,515 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:21,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:38:21,540 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:38:21,574 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:21,574 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:21,574 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:21,575 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:21,575 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:21,575 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:21,575 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:21,575 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:38:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:21,597 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:21,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:21,601 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:21,608 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-03-04 16:38:21,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:21,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:21,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:21,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:21,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:38:21,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:21,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:21,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:21,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:38:21,937 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-03-04 16:38:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:22,014 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-03-04 16:38:22,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:22,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:38:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:22,028 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:38:22,029 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:38:22,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:38:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:38:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-03-04 16:38:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:38:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:38:22,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-03-04 16:38:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:22,070 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:38:22,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:38:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:22,070 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:22,071 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:38:22,071 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-03-04 16:38:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:22,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:22,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:22,488 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:22,490 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-03-04 16:38:22,556 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:22,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:23,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:23,031 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:23,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:23,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:38:23,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:23,462 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2019-03-04 16:38:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:23,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:23,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:23,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-03-04 16:38:23,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:23,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:23,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:23,616 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2019-03-04 16:38:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:23,698 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-03-04 16:38:23,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:23,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:38:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:23,699 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:38:23,699 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:38:23,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:38:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-03-04 16:38:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:38:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-03-04 16:38:23,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-03-04 16:38:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:23,705 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-03-04 16:38:23,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-03-04 16:38:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:38:23,706 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:23,707 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-03-04 16:38:23,707 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-03-04 16:38:23,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:23,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-03-04 16:38:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-03-04 16:38:23,844 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-03-04 16:38:23,873 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:38:23 BoogieIcfgContainer [2019-03-04 16:38:23,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:38:23,874 INFO L168 Benchmark]: Toolchain (without parser) took 2796.23 ms. Allocated memory was 133.7 MB in the beginning and 258.5 MB in the end (delta: 124.8 MB). Free memory was 108.7 MB in the beginning and 238.6 MB in the end (delta: -129.9 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:23,876 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:38:23,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.88 ms. Allocated memory is still 133.7 MB. Free memory was 108.7 MB in the beginning and 107.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:23,879 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:23,880 INFO L168 Benchmark]: RCFGBuilder took 353.34 ms. Allocated memory is still 133.7 MB. Free memory was 105.7 MB in the beginning and 94.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:23,882 INFO L168 Benchmark]: TraceAbstraction took 2375.31 ms. Allocated memory was 133.7 MB in the beginning and 258.5 MB in the end (delta: 124.8 MB). Free memory was 94.1 MB in the beginning and 238.6 MB in the end (delta: -144.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:23,893 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.88 ms. Allocated memory is still 133.7 MB. Free memory was 108.7 MB in the beginning and 107.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.85 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 353.34 ms. Allocated memory is still 133.7 MB. Free memory was 105.7 MB in the beginning and 94.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2375.31 ms. Allocated memory was 133.7 MB in the beginning and 258.5 MB in the end (delta: 124.8 MB). Free memory was 94.1 MB in the beginning and 238.6 MB in the end (delta: -144.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 82]: assertion can be violated assertion can be violated We found a FailurePath: [L33] #NULL.base, #NULL.offset := 0, 0; [L34] #valid := #valid[0 := 0]; [L35] ~tmp.base, ~tmp.offset := 0, 0; [L36] havoc main_#res; [L37] havoc main_#t~ret2, main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset; [L38] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L39] #Ultimate.alloc_~size := 8; [L40] havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L41] havoc #valid, #length; [L42] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0; [L43] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L44] assume #Ultimate.alloc_#res.offset == 0; [L45] assume #Ultimate.alloc_#res.base != 0; [L46] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L47] main_~#pathbuf~6.base, main_~#pathbuf~6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L48] main_~bound~6.base, main_~bound~6.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 32 - 4; [L49] ~tmp.base, ~tmp.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4; [L50] glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset; [L51] havoc glob2_#res; [L52] havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~4.base, glob2_~p~4.offset; [L53] glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset; [L54] glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset; [L55] havoc glob2_~p~4.base, glob2_~p~4.offset; [L56] glob2_~p~4.base, glob2_~p~4.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=0, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, ~tmp.base=29, ~tmp.offset=4] [L60] assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset); [L61] __VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0); [L62] havoc __VERIFIER_assert_~cond; [L63] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=0, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, ~tmp.base=29, ~tmp.offset=4] [L68] assume !(__VERIFIER_assert_~cond == 0); [L69] write~int_old_#memory_int := #memory_int; [L70] write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 1, glob2_~p~4.base, glob2_~p~4.offset, 4; [L71] havoc #memory_int; [L72] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value]; [L73] glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~4.base, glob2_~p~4.offset; [L74] glob2_~p~4.base, glob2_~p~4.offset := glob2_#t~post0.base, glob2_#t~post0.offset + 4; [L75] havoc glob2_#t~post0.base, glob2_#t~post0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=4, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L60] assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset); [L61] __VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0); [L62] havoc __VERIFIER_assert_~cond; [L63] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=4, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L68] assume !(__VERIFIER_assert_~cond == 0); [L69] write~int_old_#memory_int := #memory_int; [L70] write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 1, glob2_~p~4.base, glob2_~p~4.offset, 4; [L71] havoc #memory_int; [L72] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value]; [L73] glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~4.base, glob2_~p~4.offset; [L74] glob2_~p~4.base, glob2_~p~4.offset := glob2_#t~post0.base, glob2_#t~post0.offset + 4; [L75] havoc glob2_#t~post0.base, glob2_#t~post0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=8, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L60] assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset); [L61] __VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0); [L62] havoc __VERIFIER_assert_~cond; [L63] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=8, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L78] assume __VERIFIER_assert_~cond == 0; [L79] assume !false; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=8, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] [L82] assert false; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=29, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=29, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=29, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=29, glob2_~pathbuf.offset=0, glob2_~pathlim.base=29, glob2_~pathlim.offset=28, glob2_~p~4.base=29, glob2_~p~4.offset=8, main_~#pathbuf~6.base=29, main_~#pathbuf~6.offset=0, main_~bound~6.base=29, main_~bound~6.offset=28, write~int_#ptr.base=29, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp.base=29, ~tmp.offset=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 2.3s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7 SDtfs, 2 SDslu, 12 SDs, 0 SdLazy, 20 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 574 SizeOfPredicates, 14 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...