java -ea -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 -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/bAnd5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:24:35,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:24:35,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:24:35,339 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:24:35,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:24:35,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:24:35,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:24:35,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:24:35,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:24:35,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:24:35,348 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:24:35,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:24:35,349 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:24:35,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:24:35,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:24:35,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:24:35,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:24:35,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:24:35,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:24:35,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:24:35,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:24:35,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:24:35,363 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:24:35,363 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:24:35,363 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:24:35,364 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:24:35,365 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:24:35,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:24:35,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:24:35,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:24:35,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:24:35,369 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:24:35,369 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:24:35,369 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:24:35,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:24:35,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:24:35,372 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:24:35,387 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:24:35,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:24:35,388 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:24:35,388 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:24:35,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:24:35,389 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:24:35,389 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:24:35,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:24:35,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:24:35,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:24:35,392 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:24:35,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:24:35,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:24:35,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:24:35,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:24:35,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:24:35,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:24:35,397 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:24:35,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:24:35,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:24:35,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:24:35,399 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:24:35,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:24:35,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:24:35,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:24:35,400 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:24:35,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:24:35,400 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:24:35,401 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:24:35,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:24:35,401 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:24:35,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:24:35,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:24:35,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:24:35,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:24:35,481 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:24:35,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd5_true-unreach-call.i [2018-11-23 12:24:35,549 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3786ed590/e0a64343511b4620831ef529570b9a57/FLAG0aae84b76 [2018-11-23 12:24:35,997 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:24:35,998 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5_true-unreach-call.i [2018-11-23 12:24:36,008 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3786ed590/e0a64343511b4620831ef529570b9a57/FLAG0aae84b76 [2018-11-23 12:24:36,357 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3786ed590/e0a64343511b4620831ef529570b9a57 [2018-11-23 12:24:36,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:24:36,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:24:36,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:24:36,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:24:36,373 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:24:36,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bd3587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36, skipping insertion in model container [2018-11-23 12:24:36,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:24:36,414 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:24:36,646 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:24:36,660 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:24:36,688 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:24:36,706 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:24:36,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36 WrapperNode [2018-11-23 12:24:36,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:24:36,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:24:36,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:24:36,708 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:24:36,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:24:36,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:24:36,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:24:36,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:24:36,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... [2018-11-23 12:24:36,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:24:36,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:24:36,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:24:36,774 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:24:36,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:24:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:24:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:24:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:24:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:24:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2018-11-23 12:24:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2018-11-23 12:24:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:24:36,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:24:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:24:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:24:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:24:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:24:37,627 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:24:37,627 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:24:37,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:24:37 BoogieIcfgContainer [2018-11-23 12:24:37,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:24:37,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:24:37,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:24:37,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:24:37,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:24:36" (1/3) ... [2018-11-23 12:24:37,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d0e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:24:37, skipping insertion in model container [2018-11-23 12:24:37,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:24:36" (2/3) ... [2018-11-23 12:24:37,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d0e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:24:37, skipping insertion in model container [2018-11-23 12:24:37,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:24:37" (3/3) ... [2018-11-23 12:24:37,637 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd5_true-unreach-call.i [2018-11-23 12:24:37,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:24:37,653 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:24:37,672 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:24:37,706 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:24:37,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:24:37,707 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:24:37,707 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:24:37,707 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:24:37,707 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:24:37,707 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:24:37,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:24:37,708 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:24:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:24:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:24:37,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:37,735 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:24:37,737 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:37,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1931873834, now seen corresponding path program 1 times [2018-11-23 12:24:37,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:37,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:37,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:37,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:38,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:24:38,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {34#true} is VALID [2018-11-23 12:24:38,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:24:38,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 12:24:38,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:24:38,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {34#true} is VALID [2018-11-23 12:24:38,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {36#(<= 2 ~N~0)} is VALID [2018-11-23 12:24:38,354 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#(<= 2 ~N~0)} call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:24:38,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#(= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:38,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#(= bAnd_~i~0 1)} assume !(~i~0 < ~N~0); {38#(<= ~N~0 1)} is VALID [2018-11-23 12:24:38,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#(<= ~N~0 1)} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {38#(<= ~N~0 1)} is VALID [2018-11-23 12:24:38,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#(<= ~N~0 1)} assume true; {38#(<= ~N~0 1)} is VALID [2018-11-23 12:24:38,373 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {38#(<= ~N~0 1)} {36#(<= 2 ~N~0)} #64#return; {35#false} is VALID [2018-11-23 12:24:38,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:24:38,374 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:24:38,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:24:38,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < ~N~0); {34#true} is VALID [2018-11-23 12:24:38,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:24:38,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:24:38,376 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #66#return; {35#false} is VALID [2018-11-23 12:24:38,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {35#false} is VALID [2018-11-23 12:24:38,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !(~i~1 < ~N~0 - 1); {35#false} is VALID [2018-11-23 12:24:38,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {35#false} is VALID [2018-11-23 12:24:38,377 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:24:38,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:24:38,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < ~N~0); {34#true} is VALID [2018-11-23 12:24:38,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:24:38,378 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:24:38,379 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #68#return; {35#false} is VALID [2018-11-23 12:24:38,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 12:24:38,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {35#false} is VALID [2018-11-23 12:24:38,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:24:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:24:38,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:38,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:24:38,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:38,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:39,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:24:39,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {34#true} is VALID [2018-11-23 12:24:39,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:24:39,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 12:24:39,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:24:39,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {34#true} is VALID [2018-11-23 12:24:39,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {36#(<= 2 ~N~0)} is VALID [2018-11-23 12:24:39,048 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#(<= 2 ~N~0)} call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); {36#(<= 2 ~N~0)} is VALID [2018-11-23 12:24:39,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#(<= 2 ~N~0)} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {66#(and (<= 2 ~N~0) (<= bAnd_~i~0 1))} is VALID [2018-11-23 12:24:39,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {66#(and (<= 2 ~N~0) (<= bAnd_~i~0 1))} assume !(~i~0 < ~N~0); {35#false} is VALID [2018-11-23 12:24:39,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:24:39,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:24:39,072 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {36#(<= 2 ~N~0)} #64#return; {35#false} is VALID [2018-11-23 12:24:39,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:24:39,073 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 12:24:39,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35#false} is VALID [2018-11-23 12:24:39,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !(~i~0 < ~N~0); {35#false} is VALID [2018-11-23 12:24:39,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:24:39,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:24:39,074 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2018-11-23 12:24:39,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {35#false} is VALID [2018-11-23 12:24:39,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !(~i~1 < ~N~0 - 1); {35#false} is VALID [2018-11-23 12:24:39,075 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {35#false} is VALID [2018-11-23 12:24:39,076 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 12:24:39,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35#false} is VALID [2018-11-23 12:24:39,077 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !(~i~0 < ~N~0); {35#false} is VALID [2018-11-23 12:24:39,077 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {35#false} is VALID [2018-11-23 12:24:39,077 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 12:24:39,078 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #68#return; {35#false} is VALID [2018-11-23 12:24:39,078 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 12:24:39,078 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {35#false} is VALID [2018-11-23 12:24:39,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:24:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:24:39,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:24:39,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-23 12:24:39,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:24:39,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:39,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:24:39,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:39,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:24:39,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:24:39,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:24:39,290 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2018-11-23 12:24:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:40,387 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 12:24:40,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:24:40,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 12:24:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:24:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-23 12:24:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:24:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2018-11-23 12:24:40,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2018-11-23 12:24:40,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:40,638 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:24:40,638 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:24:40,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:24:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:24:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 12:24:40,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:40,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 12:24:40,718 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 12:24:40,718 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 12:24:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:40,725 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:24:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:24:40,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:40,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:40,727 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 12:24:40,727 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 12:24:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:40,733 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:24:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:24:40,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:40,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:40,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:40,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 12:24:40,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 32 [2018-11-23 12:24:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:40,740 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 12:24:40,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:24:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:24:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:24:40,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:40,743 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:24:40,743 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:40,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash -334011672, now seen corresponding path program 1 times [2018-11-23 12:24:40,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:40,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:40,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:40,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2018-11-23 12:24:40,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; {306#true} is VALID [2018-11-23 12:24:40,870 INFO L273 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2018-11-23 12:24:40,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #60#return; {306#true} is VALID [2018-11-23 12:24:40,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret12 := main(); {306#true} is VALID [2018-11-23 12:24:40,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; {306#true} is VALID [2018-11-23 12:24:40,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#true} assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; {308#(<= 2 ~N~0)} is VALID [2018-11-23 12:24:40,873 INFO L256 TraceCheckUtils]: 7: Hoare triple {308#(<= 2 ~N~0)} call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); {306#true} is VALID [2018-11-23 12:24:40,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {306#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {306#true} is VALID [2018-11-23 12:24:40,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {306#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {306#true} is VALID [2018-11-23 12:24:40,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {306#true} is VALID [2018-11-23 12:24:40,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {306#true} assume !(~i~0 < ~N~0); {306#true} is VALID [2018-11-23 12:24:40,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {306#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {306#true} is VALID [2018-11-23 12:24:40,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {306#true} assume true; {306#true} is VALID [2018-11-23 12:24:40,893 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {306#true} {308#(<= 2 ~N~0)} #64#return; {308#(<= 2 ~N~0)} is VALID [2018-11-23 12:24:40,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {308#(<= 2 ~N~0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {308#(<= 2 ~N~0)} is VALID [2018-11-23 12:24:40,902 INFO L256 TraceCheckUtils]: 16: Hoare triple {308#(<= 2 ~N~0)} call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); {306#true} is VALID [2018-11-23 12:24:40,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {306#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {306#true} is VALID [2018-11-23 12:24:40,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {306#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {306#true} is VALID [2018-11-23 12:24:40,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {306#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {306#true} is VALID [2018-11-23 12:24:40,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {306#true} assume !(~i~0 < ~N~0); {306#true} is VALID [2018-11-23 12:24:40,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {306#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {306#true} is VALID [2018-11-23 12:24:40,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {306#true} assume true; {306#true} is VALID [2018-11-23 12:24:40,907 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {306#true} {308#(<= 2 ~N~0)} #66#return; {308#(<= 2 ~N~0)} is VALID [2018-11-23 12:24:40,907 INFO L273 TraceCheckUtils]: 24: Hoare triple {308#(<= 2 ~N~0)} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; {309#(and (<= 2 ~N~0) (= main_~i~1 0))} is VALID [2018-11-23 12:24:40,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {309#(and (<= 2 ~N~0) (= main_~i~1 0))} assume !(~i~1 < ~N~0 - 1); {307#false} is VALID [2018-11-23 12:24:40,909 INFO L273 TraceCheckUtils]: 26: Hoare triple {307#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); {307#false} is VALID [2018-11-23 12:24:40,909 INFO L256 TraceCheckUtils]: 27: Hoare triple {307#false} call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); {306#true} is VALID [2018-11-23 12:24:40,909 INFO L273 TraceCheckUtils]: 28: Hoare triple {306#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {306#true} is VALID [2018-11-23 12:24:40,910 INFO L273 TraceCheckUtils]: 29: Hoare triple {306#true} assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {306#true} is VALID [2018-11-23 12:24:40,910 INFO L273 TraceCheckUtils]: 30: Hoare triple {306#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {306#true} is VALID [2018-11-23 12:24:40,910 INFO L273 TraceCheckUtils]: 31: Hoare triple {306#true} assume !(~i~0 < ~N~0); {306#true} is VALID [2018-11-23 12:24:40,910 INFO L273 TraceCheckUtils]: 32: Hoare triple {306#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {306#true} is VALID [2018-11-23 12:24:40,911 INFO L273 TraceCheckUtils]: 33: Hoare triple {306#true} assume true; {306#true} is VALID [2018-11-23 12:24:40,911 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {306#true} {307#false} #68#return; {307#false} is VALID [2018-11-23 12:24:40,911 INFO L273 TraceCheckUtils]: 35: Hoare triple {307#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {307#false} is VALID [2018-11-23 12:24:40,912 INFO L273 TraceCheckUtils]: 36: Hoare triple {307#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {307#false} is VALID [2018-11-23 12:24:40,912 INFO L273 TraceCheckUtils]: 37: Hoare triple {307#false} assume !false; {307#false} is VALID [2018-11-23 12:24:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:24:40,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:24:40,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:24:40,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 12:24:40,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:40,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:24:41,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:41,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:24:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:24:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:24:41,013 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2018-11-23 12:24:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:41,184 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 12:24:41,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:24:41,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 12:24:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:24:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:24:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:24:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-23 12:24:41,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2018-11-23 12:24:41,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:41,293 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:24:41,293 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:24:41,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:24:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:24:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:24:41,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:41,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:24:41,338 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:24:41,338 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:24:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:41,341 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 12:24:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:24:41,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:41,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:41,342 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:24:41,343 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:24:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:41,346 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 12:24:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 12:24:41,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:41,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:41,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:41,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:24:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 12:24:41,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 38 [2018-11-23 12:24:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:41,351 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 12:24:41,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:24:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:24:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:24:41,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:41,353 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:24:41,353 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:41,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash -743279130, now seen corresponding path program 1 times [2018-11-23 12:24:41,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:41,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:41,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:41,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:41,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:24:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:24:41,579 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4294967298, |#NULL.offset|=4294967295, |old(#NULL.base)|=4294967298, |old(#NULL.offset)|=4294967295, |old(~N~0)|=4294967296, ~N~0=4294967296] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967298, |old(#NULL.offset)|=4294967295, |old(~N~0)|=4294967296, ~N~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967298, |old(#NULL.offset)|=4294967295, |old(~N~0)|=4294967296, ~N~0=0] [?] RET #60#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=0] [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~N~0 := #t~nondet3;havoc #t~nondet3; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] CALL call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; VAL [bAnd_~i~0=1, bAnd_~res~0=4294967297, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; VAL [bAnd_~i~0=1, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [bAnd_~i~0=2, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !(~i~0 < ~N~0); VAL [bAnd_~i~0=2, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [bAnd_~i~0=2, bAnd_~res~0=4294967294, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |bAnd_#res|=(- 2), |old(~N~0)|=0, ~N~0=2] [?] assume true; VAL [bAnd_~i~0=2, bAnd_~res~0=4294967294, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |bAnd_#res|=(- 2), |old(~N~0)|=0, ~N~0=2] [?] RET #64#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=(- 2), |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~0 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] CALL call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; VAL [bAnd_~i~0=1, bAnd_~res~0=4294967297, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; VAL [bAnd_~i~0=1, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [bAnd_~i~0=2, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !(~i~0 < ~N~0); VAL [bAnd_~i~0=2, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [bAnd_~i~0=2, bAnd_~res~0=4294967293, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |bAnd_#res|=(- 3), |old(~N~0)|=0, ~N~0=2] [?] assume true; VAL [bAnd_~i~0=2, bAnd_~res~0=4294967293, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |bAnd_#res|=(- 3), |old(~N~0)|=0, ~N~0=2] [?] RET #66#return; VAL [main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=(- 3), |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~1 := 0; VAL [main_~i~1=0, main_~ret2~0=(- 3), main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !!(~i~1 < ~N~0 - 1);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~mem10; VAL [main_~i~1=0, main_~ret2~0=(- 3), main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] #t~post9 := ~i~1;~i~1 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~1=1, main_~ret2~0=(- 3), main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !(~i~1 < ~N~0 - 1); VAL [main_~i~1=1, main_~ret2~0=(- 3), main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [main_~i~1=1, main_~ret2~0=(- 3), main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] CALL call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; VAL [bAnd_~i~0=1, bAnd_~res~0=4294967297, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !!(~i~0 < ~N~0);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; VAL [bAnd_~i~0=1, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [bAnd_~i~0=2, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !(~i~0 < ~N~0); VAL [bAnd_~i~0=2, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [bAnd_~i~0=2, bAnd_~res~0=2147483647, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |bAnd_#res|=2147483647, |old(~N~0)|=0, ~N~0=2] [?] assume true; VAL [bAnd_~i~0=2, bAnd_~res~0=2147483647, bAnd_~x.base=4294967299, bAnd_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |bAnd_#in~x.base|=4294967299, |bAnd_#in~x.offset|=0, |bAnd_#res|=2147483647, |old(~N~0)|=0, ~N~0=2] [?] RET #68#return; VAL [main_~i~1=1, main_~ret2~0=(- 3), main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=2147483647, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; VAL [main_~i~1=1, main_~ret2~0=(- 3), main_~ret5~0=2147483647, main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; VAL [main_~i~1=1, main_~ret2~0=(- 3), main_~ret5~0=2147483647, main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] assume !false; VAL [main_~i~1=1, main_~ret2~0=(- 3), main_~ret5~0=2147483647, main_~ret~0=(- 2), main_~temp~0=4294967297, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=4294967299, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967298, #NULL.offset=4294967295, old(#NULL.base)=4294967298, old(#NULL.offset)=4294967295, old(~N~0)=4294967296, ~N~0=4294967296] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L6] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967298, old(#NULL.offset)=4294967295, old(~N~0)=4294967296, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967298, old(#NULL.offset)=4294967295, old(~N~0)=4294967296, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L22-L43] assume ~N~0 > 1; [L23] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~N~0=2] [L29] CALL call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967294, ~x.base=4294967299, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967294, ~x.base=4294967299, ~x.offset=0] [L29] RET call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=-2, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L31] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L31] havoc #t~mem6; [L31] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] CALL call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-3, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967293, ~x.base=4294967299, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-3, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967293, ~x.base=4294967299, ~x.offset=0] [L32] RET call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=-3, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] assume !!(~i~1 < ~N~0 - 1); [L35] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4); [L35] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4); [L35] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] assume !(~i~1 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L37] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] CALL call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483647, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483647, ~x.base=4294967299, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483647, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483647, ~x.base=4294967299, ~x.offset=0] [L38] RET call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=2147483647, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L40-L42] assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L41] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967298, #NULL.offset=4294967295, old(#NULL.base)=4294967298, old(#NULL.offset)=4294967295, old(~N~0)=4294967296, ~N~0=4294967296] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L6] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967298, old(#NULL.offset)=4294967295, old(~N~0)=4294967296, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967298, old(#NULL.offset)=4294967295, old(~N~0)=4294967296, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L22-L43] assume ~N~0 > 1; [L23] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~N~0=2] [L29] CALL call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967294, ~x.base=4294967299, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967294, ~x.base=4294967299, ~x.offset=0] [L29] RET call #t~ret4 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=-2, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L31] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L31] havoc #t~mem6; [L31] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] CALL call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-3, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967293, ~x.base=4294967299, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-3, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967293, ~x.base=4294967299, ~x.offset=0] [L32] RET call #t~ret7 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=-3, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] assume !!(~i~1 < ~N~0 - 1); [L35] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~1), 4); [L35] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4); [L35] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] assume !(~i~1 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L37] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] CALL call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] call #t~mem0 := read~int(~x.base, ~x.offset, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !!(~i~0 < ~N~0); [L14] call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L13-L15] assume !(~i~0 < ~N~0); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x.base=4294967299, ~x.offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483647, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483647, ~x.base=4294967299, ~x.offset=0] [L8-L17] ensures true; VAL [#in~x.base=4294967299, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=2147483647, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483647, ~x.base=4294967299, ~x.offset=0] [L38] RET call #t~ret11 := bAnd(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=2147483647, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L40-L42] assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L41] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=4294967299, ~#x~0.offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967298, #NULL!offset=4294967295, old(#NULL!base)=4294967298, old(#NULL!offset)=4294967295, old(~N~0)=4294967296, ~N~0=4294967296] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967298, old(#NULL!offset)=4294967295, old(~N~0)=4294967296, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L22] COND TRUE ~N~0 > 1 [L23] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2] [L29] CALL call #t~ret4 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967294, ~x!base=4294967299, ~x!offset=0] [L29] RET call #t~ret4 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L31] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] havoc #t~mem6; [L31] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] CALL call #t~ret7 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-3, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967293, ~x!base=4294967299, ~x!offset=0] [L32] RET call #t~ret7 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-3, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] COND FALSE !(!(~i~1 < ~N~0 - 1)) [L35] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~1) }, 4); [L35] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~1 }, 4); [L35] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] COND TRUE !(~i~1 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L37] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] CALL call #t~ret11 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483647, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483647, ~x!base=4294967299, ~x!offset=0] [L38] RET call #t~ret11 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=2147483647, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L40] COND TRUE ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L41] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967298, #NULL!offset=4294967295, old(#NULL!base)=4294967298, old(#NULL!offset)=4294967295, old(~N~0)=4294967296, ~N~0=4294967296] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967298, old(#NULL!offset)=4294967295, old(~N~0)=4294967296, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L22] COND TRUE ~N~0 > 1 [L23] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2] [L29] CALL call #t~ret4 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967294, ~x!base=4294967299, ~x!offset=0] [L29] RET call #t~ret4 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L31] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] havoc #t~mem6; [L31] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] CALL call #t~ret7 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-3, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967293, ~x!base=4294967299, ~x!offset=0] [L32] RET call #t~ret7 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-3, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] COND FALSE !(!(~i~1 < ~N~0 - 1)) [L35] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~1) }, 4); [L35] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~1 }, 4); [L35] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] COND TRUE !(~i~1 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L37] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] CALL call #t~ret11 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483647, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483647, ~x!base=4294967299, ~x!offset=0] [L38] RET call #t~ret11 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=2147483647, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L40] COND TRUE ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L41] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967298, #NULL!offset=4294967295, old(#NULL!base)=4294967298, old(#NULL!offset)=4294967295, old(~N~0)=4294967296, ~N~0=4294967296] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967298, old(#NULL!offset)=4294967295, old(~N~0)=4294967296, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L22] COND TRUE ~N~0 > 1 [L23] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2] [L29] CALL call #t~ret4 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967294, ~x!base=4294967299, ~x!offset=0] [L29] RET call #t~ret4 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L31] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] havoc #t~mem6; [L31] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] CALL call #t~ret7 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-3, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967293, ~x!base=4294967299, ~x!offset=0] [L32] RET call #t~ret7 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-3, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] COND FALSE !(!(~i~1 < ~N~0 - 1)) [L35] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~1) }, 4); [L35] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~1 }, 4); [L35] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] COND TRUE !(~i~1 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L37] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] CALL call #t~ret11 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483647, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483647, ~x!base=4294967299, ~x!offset=0] [L38] RET call #t~ret11 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=2147483647, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L40] COND TRUE ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L41] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967298, #NULL!offset=4294967295, old(#NULL!base)=4294967298, old(#NULL!offset)=4294967295, old(~N~0)=4294967296, ~N~0=4294967296] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967298, old(#NULL!offset)=4294967295, old(~N~0)=4294967296, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~N~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L22] COND TRUE ~N~0 > 1 [L23] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); [L24] havoc ~temp~0; [L25] havoc ~ret~0; [L26] havoc ~ret2~0; [L27] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2] [L29] CALL call #t~ret4 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967294, ~x!base=4294967299, ~x!offset=0] [L29] RET call #t~ret4 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2] [L29] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L29] ~ret~0 := #t~ret4; [L29] havoc #t~ret4; [L31] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] ~temp~0 := #t~mem5; [L31] havoc #t~mem5; [L31] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L31] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L31] havoc #t~mem6; [L31] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] CALL call #t~ret7 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-3, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=4294967293, ~x!base=4294967299, ~x!offset=0] [L32] RET call #t~ret7 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-3, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~N~0=2, ~ret~0=-2, ~temp~0=4294967297] [L32] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L32] ~ret2~0 := #t~ret7; [L32] havoc #t~ret7; [L33] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L33] ~temp~0 := #t~mem8; [L33] havoc #t~mem8; [L34] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] COND FALSE !(!(~i~1 < ~N~0 - 1)) [L35] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~1) }, 4); [L35] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~1 }, 4); [L35] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=0, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34] #t~post9 := ~i~1; [L34] ~i~1 := 1 + #t~post9; [L34] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L34-L36] COND TRUE !(~i~1 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L37] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] CALL call #t~ret11 := bAnd(~#x~0); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=2] [L8-L17] ~x := #in~x; [L10] havoc ~i~0; [L11] havoc ~res~0; [L12] FCALL call #t~mem0 := read~int({ base: ~x!base, offset: ~x!offset }, 4); [L12] ~res~0 := #t~mem0; [L12] havoc #t~mem0; [L13] ~i~0 := 1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~res~0=4294967297, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~N~0)) [L14] FCALL call #t~mem2 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L14] ~res~0 := ~bitwiseAnd(~res~0, #t~mem2); [L14] havoc #t~mem2; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L13-L15] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=2, ~x!base=4294967299, ~x!offset=0] [L16] #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); VAL [#in~x!base=4294967299, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=2147483647, old(~N~0)=0, ~i~0=2, ~N~0=2, ~res~0=2147483647, ~x!base=4294967299, ~x!offset=0] [L38] RET call #t~ret11 := bAnd(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=2147483647, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret~0=-2, ~temp~0=4294967297] [L38] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L38] ~ret5~0 := #t~ret11; [L38] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L40] COND TRUE ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L41] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=4294967299, ~#x~0!offset=0, ~i~1=1, ~N~0=2, ~ret2~0=-3, ~ret5~0=2147483647, ~ret~0=-2, ~temp~0=4294967297] [L6] int N; VAL [\old(N)=4294967296, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND TRUE N > 1 [L23] int x[N]; [L24] int temp; [L25] int ret; [L26] int ret2; [L27] int ret5; VAL [\old(N)=0, N=2, x={4294967299:0}] [L29] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={4294967299:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=4294967297, x={4294967299:0}, x={4294967299:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res & x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={4294967299:0}, x={4294967299:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={4294967299:0}, x={4294967299:0}] [L16] return res; VAL [\old(N)=0, \result=-2, i=2, N=2, res=4294967294, x={4294967299:0}, x={4294967299:0}] [L29] RET, EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-2, N=2, x={4294967299:0}] [L29] ret = bAnd(x) [L31] EXPR x[0] [L31] temp=x[0] [L31] EXPR x[1] [L31] x[0] = x[1] [L31] x[1] = temp VAL [\old(N)=0, N=2, ret=-2, temp=4294967297, x={4294967299:0}] [L32] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={4294967299:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=4294967297, x={4294967299:0}, x={4294967299:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res & x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={4294967299:0}, x={4294967299:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={4294967299:0}, x={4294967299:0}] [L16] return res; VAL [\old(N)=0, \result=-3, i=2, N=2, res=4294967293, x={4294967299:0}, x={4294967299:0}] [L32] RET, EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-3, N=2, ret=-2, temp=4294967297, x={4294967299:0}] [L32] ret2 = bAnd(x) [L33] EXPR x[0] [L33] temp=x[0] [L34] int i =0 ; VAL [\old(N)=0, i=0, N=2, ret=-2, ret2=-3, temp=4294967297, x={4294967299:0}] [L34] COND TRUE i 1 [L23] int x[N]; [L24] int temp; [L25] int ret; [L26] int ret2; [L27] int ret5; VAL [\old(N)=0, N=2, x={4294967299:0}] [L29] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={4294967299:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=4294967297, x={4294967299:0}, x={4294967299:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res & x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={4294967299:0}, x={4294967299:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={4294967299:0}, x={4294967299:0}] [L16] return res; VAL [\old(N)=0, \result=-2, i=2, N=2, res=4294967294, x={4294967299:0}, x={4294967299:0}] [L29] RET, EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-2, N=2, x={4294967299:0}] [L29] ret = bAnd(x) [L31] EXPR x[0] [L31] temp=x[0] [L31] EXPR x[1] [L31] x[0] = x[1] [L31] x[1] = temp VAL [\old(N)=0, N=2, ret=-2, temp=4294967297, x={4294967299:0}] [L32] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={4294967299:0}] [L10] int i; [L11] long long res; [L12] EXPR x[0] [L12] res = x[0] [L13] i = 1 VAL [\old(N)=0, i=1, N=2, res=4294967297, x={4294967299:0}, x={4294967299:0}] [L13] COND TRUE i < N [L14] EXPR x[i] [L14] res = res & x[i] [L13] i++ VAL [\old(N)=0, i=2, N=2, x={4294967299:0}, x={4294967299:0}] [L13] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={4294967299:0}, x={4294967299:0}] [L16] return res; VAL [\old(N)=0, \result=-3, i=2, N=2, res=4294967293, x={4294967299:0}, x={4294967299:0}] [L32] RET, EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-3, N=2, ret=-2, temp=4294967297, x={4294967299:0}] [L32] ret2 = bAnd(x) [L33] EXPR x[0] [L33] temp=x[0] [L34] int i =0 ; VAL [\old(N)=0, i=0, N=2, ret=-2, ret2=-3, temp=4294967297, x={4294967299:0}] [L34] COND TRUE i