java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:15:51,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:15:51,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:15:51,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:15:51,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:15:51,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:15:51,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:15:51,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:15:51,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:15:51,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:15:51,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:15:51,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:15:51,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:15:51,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:15:51,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:15:51,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:15:51,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:15:51,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:15:51,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:15:51,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:15:51,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:15:51,633 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:15:51,636 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:15:51,636 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:15:51,636 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:15:51,637 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:15:51,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:15:51,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:15:51,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:15:51,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:15:51,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:15:51,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:15:51,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:15:51,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:15:51,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:15:51,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:15:51,651 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:15:51,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:15:51,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:15:51,662 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:15:51,662 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:15:51,662 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:15:51,662 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:15:51,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:15:51,663 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:15:51,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:15:51,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:15:51,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:15:51,664 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:15:51,664 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:15:51,665 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:15:51,665 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:15:51,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:15:51,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:15:51,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:15:51,731 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:15:51,732 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:15:51,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl [2018-10-15 13:15:51,733 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl' [2018-10-15 13:15:51,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:15:51,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:15:51,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:15:51,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:15:51,813 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:15:51,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/1) ... [2018-10-15 13:15:51,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/1) ... [2018-10-15 13:15:51,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/1) ... [2018-10-15 13:15:51,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/1) ... [2018-10-15 13:15:51,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/1) ... [2018-10-15 13:15:51,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/1) ... [2018-10-15 13:15:51,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/1) ... [2018-10-15 13:15:51,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:15:51,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:15:51,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:15:51,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:15:51,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:15:51,933 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:15:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:15:51,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:15:52,438 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:15:52,439 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:15:52 BoogieIcfgContainer [2018-10-15 13:15:52,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:15:52,440 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:15:52,440 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:15:52,441 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:15:52,445 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:15:52" (1/1) ... [2018-10-15 13:15:52,455 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 13:15:52,455 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 13:15:52,491 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 13:15:52,536 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 13:15:52,551 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 13:15:52,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 13:15:56,427 INFO L315 AbstractInterpreter]: Visited 41 different actions 73 times. Merged at 15 different actions 30 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-15 13:15:56,431 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 13:15:56,437 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 13:15:56,495 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_2|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-15 13:15:56,499 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 13:15:56,500 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 13:15:56,500 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 13:15:56,500 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 13:15:56,503 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 13:15:56,503 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 13:15:56,503 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-15 13:15:56,504 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-15 13:15:56,504 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 13:15:56,504 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 13:15:56,504 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 13:15:56,504 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 13:15:56,505 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 13:15:56,505 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-15 13:15:56,505 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-15 13:15:56,510 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 13:15:56,527 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:15:56 BasicIcfg [2018-10-15 13:15:56,528 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:15:56,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:15:56,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:15:56,533 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:15:56,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:15:51" (1/3) ... [2018-10-15 13:15:56,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7182e6d7 and model type verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:15:56, skipping insertion in model container [2018-10-15 13:15:56,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:15:52" (2/3) ... [2018-10-15 13:15:56,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7182e6d7 and model type verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:15:56, skipping insertion in model container [2018-10-15 13:15:56,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:15:56" (3/3) ... [2018-10-15 13:15:56,538 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 13:15:56,549 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:15:56,558 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:15:56,577 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:15:56,606 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:15:56,607 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:15:56,607 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:15:56,608 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:15:56,609 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:15:56,609 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:15:56,610 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:15:56,610 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:15:56,610 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:15:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-10-15 13:15:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 13:15:56,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:56,640 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:56,641 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:56,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:56,651 INFO L82 PathProgramCache]: Analyzing trace with hash 644559505, now seen corresponding path program 1 times [2018-10-15 13:15:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:57,407 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-15 13:15:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:58,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:15:58,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-15 13:15:58,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:15:58,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:15:58,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:15:58,227 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 11 states. [2018-10-15 13:15:59,154 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-10-15 13:15:59,525 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-15 13:15:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:59,768 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 13:15:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:15:59,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-10-15 13:15:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:59,782 INFO L225 Difference]: With dead ends: 56 [2018-10-15 13:15:59,782 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 13:15:59,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:15:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 13:15:59,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2018-10-15 13:15:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 13:15:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 13:15:59,821 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 31 [2018-10-15 13:15:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:59,821 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 13:15:59,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:15:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 13:15:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 13:15:59,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:59,824 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:59,824 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:59,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 648510089, now seen corresponding path program 1 times [2018-10-15 13:15:59,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:00,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:00,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:16:00,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:16:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:16:00,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:16:00,268 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-10-15 13:16:00,943 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-10-15 13:16:01,201 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-15 13:16:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:01,695 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 13:16:01,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 13:16:01,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-10-15 13:16:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:01,697 INFO L225 Difference]: With dead ends: 68 [2018-10-15 13:16:01,698 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 13:16:01,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:16:01,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 13:16:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-10-15 13:16:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 13:16:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-15 13:16:01,706 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 44 [2018-10-15 13:16:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:01,706 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-15 13:16:01,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:16:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-15 13:16:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 13:16:01,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:01,709 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:01,709 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:01,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1179523695, now seen corresponding path program 2 times [2018-10-15 13:16:01,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 13:16:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 13:16:01,812 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 13:16:01,866 INFO L202 PluginConnector]: Adding new model verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:16:01 BasicIcfg [2018-10-15 13:16:01,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 13:16:01,867 INFO L168 Benchmark]: Toolchain (without parser) took 10056.06 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -841.7 MB). Peak memory consumption was 225.3 MB. Max. memory is 7.1 GB. [2018-10-15 13:16:01,868 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 13:16:01,869 INFO L168 Benchmark]: Boogie Preprocessor took 46.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 13:16:01,870 INFO L168 Benchmark]: RCFGBuilder took 579.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 13:16:01,870 INFO L168 Benchmark]: IcfgTransformer took 4088.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 192.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -176.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2018-10-15 13:16:01,872 INFO L168 Benchmark]: TraceAbstraction took 5336.42 ms. Allocated memory was 1.7 GB in the beginning and 2.6 GB in the end (delta: 874.0 MB). Free memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: -686.6 MB). Peak memory consumption was 187.4 MB. Max. memory is 7.1 GB. [2018-10-15 13:16:01,876 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 579.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 4088.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 192.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -176.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5336.42 ms. Allocated memory was 1.7 GB in the beginning and 2.6 GB in the end (delta: 874.0 MB). Free memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: -686.6 MB). Peak memory consumption was 187.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 745 LocStat_NO_SUPPORTING_DISEQUALITIES : 119 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 2256.18 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 83 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 41 different actions 73 times. Merged at 15 different actions 30 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 0 COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int, ULTIMATE.start_write~int_old_#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 99]: assertion can be violated assertion can be violated We found a FailurePath: [L51] #NULL.offset, #NULL.base := 0, 0; VAL [#NULL.base=0, #NULL.offset=0] [L52] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0] [L53] ~tmp~0.offset, ~tmp~0.base := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L54] havoc main_#res; VAL [#NULL.base=0, #NULL.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L55] havoc main_#t~ret1, main_~#pathbuf~0.offset, main_~bound~0.base, main_~bound~0.offset, main_~#pathbuf~0.base; VAL [#NULL.base=0, #NULL.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L56] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; VAL [#NULL.base=0, #NULL.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L57] #Ultimate.alloc_~size := 8; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_~size=8, ~tmp~0.base=0, ~tmp~0.offset=0] [L58] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_~size=8, ~tmp~0.base=0, ~tmp~0.offset=0] [L59] havoc #valid, #length; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_~size=8, ~tmp~0.base=0, ~tmp~0.offset=0] [L60] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_~size=8, ~tmp~0.base=0, ~tmp~0.offset=0] [L61] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1] == #valid; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_~size=8, ~tmp~0.base=0, ~tmp~0.offset=0] [L62] assume #Ultimate.alloc_#res.offset == 0; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, ~tmp~0.base=0, ~tmp~0.offset=0] [L63] assume !(0 == #Ultimate.alloc_#res.base); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, ~tmp~0.base=0, ~tmp~0.offset=0] [L64] assume #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size] == #length; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, ~tmp~0.base=0, ~tmp~0.offset=0] [L65] main_~#pathbuf~0.offset, main_~#pathbuf~0.base := #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L66] main_~bound~0.base, main_~bound~0.offset := main_~#pathbuf~0.base, main_~#pathbuf~0.offset + 28; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=0, ~tmp~0.offset=0] [L67] ~tmp~0.offset, ~tmp~0.base := main_~#pathbuf~0.offset + 4, main_~#pathbuf~0.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L68] glob2_#in~pathbuf.base, glob2_#in~pathlim.base, glob2_#in~pathlim.offset, glob2_#in~pathbuf.offset := main_~#pathbuf~0.base, main_~bound~0.base, main_~bound~0.offset, main_~#pathbuf~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L69] havoc glob2_#res; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L70] havoc glob2_~pathlim.base, glob2_~p~0.offset, glob2_#t~post0.base, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.offset, glob2_~p~0.base, glob2_#t~post0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L71] glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L72] glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L73] havoc glob2_~p~0.offset, glob2_~p~0.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L74] glob2_~p~0.offset, glob2_~p~0.base := glob2_~pathbuf.offset, glob2_~pathbuf.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L77] assume glob2_~p~0.offset <= glob2_~pathlim.offset && glob2_~pathlim.base == glob2_~p~0.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L78] assume (!(glob2_~p~0.offset <= ~tmp~0.offset) || !(~tmp~0.base == glob2_~p~0.base)) || (~tmp~0.base == glob2_~p~0.base && glob2_~p~0.offset <= ~tmp~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L79] __VERIFIER_assert_#in~cond := (if glob2_~p~0.offset <= ~tmp~0.offset && ~tmp~0.base == glob2_~p~0.base then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L80] havoc __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L81] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L89] assume !(0 == __VERIFIER_assert_~cond); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L90] write~int_old_#memory_int := #memory_int; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, ~tmp~0.base=9, ~tmp~0.offset=4] [L91] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, glob2_~p~0.base, 1, glob2_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L92] havoc #memory_int; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L93] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L94] glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~0.base, glob2_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_#t~post0.base=9, glob2_#t~post0.offset=0, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=0, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L95] glob2_~p~0.offset, glob2_~p~0.base := glob2_#t~post0.offset + 4, glob2_#t~post0.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_#t~post0.base=9, glob2_#t~post0.offset=0, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L96] havoc glob2_#t~post0.base, glob2_#t~post0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L77] assume glob2_~p~0.offset <= glob2_~pathlim.offset && glob2_~pathlim.base == glob2_~p~0.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L78] assume (!(glob2_~p~0.offset <= ~tmp~0.offset) || !(~tmp~0.base == glob2_~p~0.base)) || (~tmp~0.base == glob2_~p~0.base && glob2_~p~0.offset <= ~tmp~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L79] __VERIFIER_assert_#in~cond := (if glob2_~p~0.offset <= ~tmp~0.offset && ~tmp~0.base == glob2_~p~0.base then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L80] havoc __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L81] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L89] assume !(0 == __VERIFIER_assert_~cond); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L90] write~int_old_#memory_int := #memory_int; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=0, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L91] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, glob2_~p~0.base, 1, glob2_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L92] havoc #memory_int; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L93] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L94] glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~0.base, glob2_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_#t~post0.base=9, glob2_#t~post0.offset=4, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=4, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L95] glob2_~p~0.offset, glob2_~p~0.base := glob2_#t~post0.offset + 4, glob2_#t~post0.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_#t~post0.base=9, glob2_#t~post0.offset=4, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L96] havoc glob2_#t~post0.base, glob2_#t~post0.offset; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L77] assume glob2_~p~0.offset <= glob2_~pathlim.offset && glob2_~pathlim.base == glob2_~p~0.base; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L78] assume (!(glob2_~p~0.offset <= ~tmp~0.offset) || !(~tmp~0.base == glob2_~p~0.base)) || (~tmp~0.base == glob2_~p~0.base && glob2_~p~0.offset <= ~tmp~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L79] __VERIFIER_assert_#in~cond := (if glob2_~p~0.offset <= ~tmp~0.offset && ~tmp~0.base == glob2_~p~0.base then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=1, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L80] havoc __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L81] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L86] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] [L99] assert false; VAL [#NULL.base=0, #NULL.offset=0, #Ultimate.alloc_#res.base=9, #Ultimate.alloc_#res.offset=0, #Ultimate.alloc_~size=8, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, glob2_#in~pathbuf.base=9, glob2_#in~pathbuf.offset=0, glob2_#in~pathlim.base=9, glob2_#in~pathlim.offset=28, glob2_~pathbuf.base=9, glob2_~pathbuf.offset=0, glob2_~pathlim.base=9, glob2_~pathlim.offset=28, glob2_~p~0.base=9, glob2_~p~0.offset=8, main_~#pathbuf~0.base=9, main_~#pathbuf~0.offset=0, main_~bound~0.base=9, main_~bound~0.offset=28, write~int_#ptr.base=9, write~int_#ptr.offset=4, write~int_#sizeOfWrittenType=4, write~int_#value=1, ~tmp~0.base=9, ~tmp~0.offset=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 1 error locations. UNSAFE Result, 5.2s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 489 SDslu, 333 SDs, 0 SdLazy, 196 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 16150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 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! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_13-16-01-894.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-15_13-16-01-894.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i_2.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-15_13-16-01-894.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...